/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/mix038_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 02:22:02,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 02:22:02,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 02:22:02,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 02:22:02,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 02:22:02,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 02:22:02,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 02:22:02,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 02:22:02,786 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 02:22:02,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 02:22:02,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 02:22:02,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 02:22:02,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 02:22:02,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 02:22:02,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 02:22:02,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 02:22:02,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 02:22:02,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 02:22:02,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 02:22:02,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 02:22:02,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 02:22:02,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 02:22:02,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 02:22:02,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 02:22:02,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 02:22:02,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 02:22:02,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 02:22:02,821 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 02:22:02,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 02:22:02,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 02:22:02,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 02:22:02,825 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 02:22:02,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 02:22:02,826 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 02:22:02,828 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 02:22:02,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 02:22:02,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 02:22:02,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 02:22:02,830 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 02:22:02,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 02:22:02,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 02:22:02,836 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 02:22:02,856 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 02:22:02,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 02:22:02,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 02:22:02,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 02:22:02,859 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 02:22:02,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 02:22:02,859 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 02:22:02,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 02:22:02,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 02:22:02,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 02:22:02,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 02:22:02,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 02:22:02,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 02:22:02,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 02:22:02,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 02:22:02,862 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 02:22:02,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 02:22:02,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 02:22:02,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 02:22:02,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 02:22:02,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 02:22:02,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 02:22:02,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 02:22:02,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 02:22:02,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 02:22:02,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 02:22:02,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 02:22:02,864 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 02:22:02,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 02:22:02,865 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 02:22:03,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 02:22:03,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 02:22:03,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 02:22:03,160 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 02:22:03,160 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 02:22:03,161 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.opt.i [2019-12-19 02:22:03,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98af43ab6/3ef2d7f2bf9b4e15a543f2a4ac90d077/FLAGbdba2b29d [2019-12-19 02:22:03,791 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 02:22:03,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.opt.i [2019-12-19 02:22:03,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98af43ab6/3ef2d7f2bf9b4e15a543f2a4ac90d077/FLAGbdba2b29d [2019-12-19 02:22:04,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98af43ab6/3ef2d7f2bf9b4e15a543f2a4ac90d077 [2019-12-19 02:22:04,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 02:22:04,079 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 02:22:04,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 02:22:04,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 02:22:04,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 02:22:04,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:22:04" (1/1) ... [2019-12-19 02:22:04,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc11e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:22:04, skipping insertion in model container [2019-12-19 02:22:04,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:22:04" (1/1) ... [2019-12-19 02:22:04,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 02:22:04,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 02:22:04,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:22:04,722 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 02:22:04,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:22:04,864 INFO L208 MainTranslator]: Completed translation [2019-12-19 02:22:04,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:22:04 WrapperNode [2019-12-19 02:22:04,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 02:22:04,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 02:22:04,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 02:22:04,866 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 02:22:04,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:22:04" (1/1) ... [2019-12-19 02:22:04,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:22:04" (1/1) ... [2019-12-19 02:22:04,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 02:22:04,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 02:22:04,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 02:22:04,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 02:22:04,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:22:04" (1/1) ... [2019-12-19 02:22:04,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:22:04" (1/1) ... [2019-12-19 02:22:04,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:22:04" (1/1) ... [2019-12-19 02:22:04,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:22:04" (1/1) ... [2019-12-19 02:22:04,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:22:04" (1/1) ... [2019-12-19 02:22:04,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:22:04" (1/1) ... [2019-12-19 02:22:04,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:22:04" (1/1) ... [2019-12-19 02:22:04,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 02:22:04,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 02:22:04,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 02:22:04,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 02:22:04,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:22:04" (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 02:22:05,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 02:22:05,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 02:22:05,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 02:22:05,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 02:22:05,048 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 02:22:05,048 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 02:22:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 02:22:05,049 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 02:22:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-19 02:22:05,049 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-19 02:22:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 02:22:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 02:22:05,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 02:22:05,051 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 02:22:05,769 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 02:22:05,769 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 02:22:05,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:22:05 BoogieIcfgContainer [2019-12-19 02:22:05,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 02:22:05,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 02:22:05,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 02:22:05,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 02:22:05,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:22:04" (1/3) ... [2019-12-19 02:22:05,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438435e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:22:05, skipping insertion in model container [2019-12-19 02:22:05,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:22:04" (2/3) ... [2019-12-19 02:22:05,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438435e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:22:05, skipping insertion in model container [2019-12-19 02:22:05,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:22:05" (3/3) ... [2019-12-19 02:22:05,786 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_power.opt.i [2019-12-19 02:22:05,797 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 02:22:05,798 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 02:22:05,811 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 02:22:05,812 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 02:22:05,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,862 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,862 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,866 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,866 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,893 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,893 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,893 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,894 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,894 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,905 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,906 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,911 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,938 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,938 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,941 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:22:05,957 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-19 02:22:05,975 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 02:22:05,976 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 02:22:05,976 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 02:22:05,976 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 02:22:05,976 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 02:22:05,976 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 02:22:05,976 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 02:22:05,976 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 02:22:05,991 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 153 places, 178 transitions [2019-12-19 02:22:24,720 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111188 states. [2019-12-19 02:22:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 111188 states. [2019-12-19 02:22:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 02:22:24,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:22:24,743 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] [2019-12-19 02:22:24,744 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 02:22:24,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:22:24,749 INFO L82 PathProgramCache]: Analyzing trace with hash -734288522, now seen corresponding path program 1 times [2019-12-19 02:22:24,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:22:24,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051065386] [2019-12-19 02:22:24,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:22:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:22:25,193 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 02:22:25,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051065386] [2019-12-19 02:22:25,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:22:25,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:22:25,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143811979] [2019-12-19 02:22:25,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:22:25,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:22:25,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:22:25,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:22:25,222 INFO L87 Difference]: Start difference. First operand 111188 states. Second operand 4 states. [2019-12-19 02:22:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:22:28,168 INFO L93 Difference]: Finished difference Result 114116 states and 522352 transitions. [2019-12-19 02:22:28,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:22:28,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-19 02:22:28,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:22:28,977 INFO L225 Difference]: With dead ends: 114116 [2019-12-19 02:22:28,978 INFO L226 Difference]: Without dead ends: 82836 [2019-12-19 02:22:28,982 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 02:22:32,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82836 states. [2019-12-19 02:22:34,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82836 to 82836. [2019-12-19 02:22:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82836 states. [2019-12-19 02:22:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82836 states to 82836 states and 380412 transitions. [2019-12-19 02:22:35,423 INFO L78 Accepts]: Start accepts. Automaton has 82836 states and 380412 transitions. Word has length 47 [2019-12-19 02:22:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:22:35,424 INFO L462 AbstractCegarLoop]: Abstraction has 82836 states and 380412 transitions. [2019-12-19 02:22:35,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:22:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 82836 states and 380412 transitions. [2019-12-19 02:22:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:22:35,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:22:35,442 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] [2019-12-19 02:22:35,443 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 02:22:35,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:22:35,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1401449056, now seen corresponding path program 1 times [2019-12-19 02:22:35,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:22:35,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936438111] [2019-12-19 02:22:35,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:22:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:22:35,560 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 02:22:35,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936438111] [2019-12-19 02:22:35,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:22:35,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:22:35,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480476331] [2019-12-19 02:22:35,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:22:35,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:22:35,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:22:35,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:22:35,566 INFO L87 Difference]: Start difference. First operand 82836 states and 380412 transitions. Second operand 5 states. [2019-12-19 02:22:41,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:22:41,032 INFO L93 Difference]: Finished difference Result 129236 states and 566704 transitions. [2019-12-19 02:22:41,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:22:41,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-19 02:22:41,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:22:41,643 INFO L225 Difference]: With dead ends: 129236 [2019-12-19 02:22:41,643 INFO L226 Difference]: Without dead ends: 126476 [2019-12-19 02:22:41,644 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 02:22:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126476 states. [2019-12-19 02:22:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126476 to 119960. [2019-12-19 02:22:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119960 states. [2019-12-19 02:22:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119960 states to 119960 states and 531551 transitions. [2019-12-19 02:22:45,762 INFO L78 Accepts]: Start accepts. Automaton has 119960 states and 531551 transitions. Word has length 55 [2019-12-19 02:22:45,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:22:45,763 INFO L462 AbstractCegarLoop]: Abstraction has 119960 states and 531551 transitions. [2019-12-19 02:22:45,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:22:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 119960 states and 531551 transitions. [2019-12-19 02:22:45,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 02:22:45,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:22:45,780 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 02:22:45,781 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 02:22:45,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:22:45,781 INFO L82 PathProgramCache]: Analyzing trace with hash -861827498, now seen corresponding path program 1 times [2019-12-19 02:22:45,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:22:45,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348691519] [2019-12-19 02:22:45,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:22:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:22:45,916 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 02:22:45,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348691519] [2019-12-19 02:22:45,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:22:45,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:22:45,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512277941] [2019-12-19 02:22:45,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:22:45,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:22:45,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:22:45,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:22:45,922 INFO L87 Difference]: Start difference. First operand 119960 states and 531551 transitions. Second operand 5 states. [2019-12-19 02:22:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:22:52,540 INFO L93 Difference]: Finished difference Result 156372 states and 680700 transitions. [2019-12-19 02:22:52,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:22:52,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-19 02:22:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:22:53,106 INFO L225 Difference]: With dead ends: 156372 [2019-12-19 02:22:53,106 INFO L226 Difference]: Without dead ends: 154132 [2019-12-19 02:22:53,107 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 02:22:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154132 states. [2019-12-19 02:22:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154132 to 132944. [2019-12-19 02:22:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132944 states. [2019-12-19 02:22:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132944 states to 132944 states and 585325 transitions. [2019-12-19 02:22:57,032 INFO L78 Accepts]: Start accepts. Automaton has 132944 states and 585325 transitions. Word has length 56 [2019-12-19 02:22:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:22:57,033 INFO L462 AbstractCegarLoop]: Abstraction has 132944 states and 585325 transitions. [2019-12-19 02:22:57,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:22:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 132944 states and 585325 transitions. [2019-12-19 02:22:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-19 02:22:57,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:22:57,055 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] [2019-12-19 02:22:57,055 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 02:22:57,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:22:57,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1595989468, now seen corresponding path program 1 times [2019-12-19 02:22:57,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:22:57,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70831755] [2019-12-19 02:22:57,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:22:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:22:57,125 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 02:22:57,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70831755] [2019-12-19 02:22:57,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:22:57,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:22:57,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534650485] [2019-12-19 02:22:57,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:22:57,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:22:57,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:22:57,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:22:57,127 INFO L87 Difference]: Start difference. First operand 132944 states and 585325 transitions. Second operand 3 states. [2019-12-19 02:22:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:22:59,263 INFO L93 Difference]: Finished difference Result 171276 states and 741342 transitions. [2019-12-19 02:22:59,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:22:59,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-19 02:22:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:22:59,820 INFO L225 Difference]: With dead ends: 171276 [2019-12-19 02:22:59,820 INFO L226 Difference]: Without dead ends: 171276 [2019-12-19 02:22:59,820 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 02:23:00,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171276 states. [2019-12-19 02:23:09,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171276 to 152000. [2019-12-19 02:23:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152000 states. [2019-12-19 02:23:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152000 states to 152000 states and 663353 transitions. [2019-12-19 02:23:11,318 INFO L78 Accepts]: Start accepts. Automaton has 152000 states and 663353 transitions. Word has length 58 [2019-12-19 02:23:11,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:23:11,318 INFO L462 AbstractCegarLoop]: Abstraction has 152000 states and 663353 transitions. [2019-12-19 02:23:11,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:23:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 152000 states and 663353 transitions. [2019-12-19 02:23:11,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-19 02:23:11,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:23:11,360 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 02:23:11,361 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 02:23:11,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:23:11,361 INFO L82 PathProgramCache]: Analyzing trace with hash 690675031, now seen corresponding path program 1 times [2019-12-19 02:23:11,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:23:11,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230265506] [2019-12-19 02:23:11,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:23:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:23:11,497 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 02:23:11,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230265506] [2019-12-19 02:23:11,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:23:11,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:23:11,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201053765] [2019-12-19 02:23:11,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:23:11,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:23:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:23:11,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:23:11,499 INFO L87 Difference]: Start difference. First operand 152000 states and 663353 transitions. Second operand 6 states. [2019-12-19 02:23:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:23:19,390 INFO L93 Difference]: Finished difference Result 196524 states and 843638 transitions. [2019-12-19 02:23:19,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:23:19,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-19 02:23:19,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:23:20,057 INFO L225 Difference]: With dead ends: 196524 [2019-12-19 02:23:20,057 INFO L226 Difference]: Without dead ends: 193924 [2019-12-19 02:23:20,058 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 02:23:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193924 states. [2019-12-19 02:23:23,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193924 to 153896. [2019-12-19 02:23:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153896 states. [2019-12-19 02:23:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153896 states to 153896 states and 672395 transitions. [2019-12-19 02:23:25,427 INFO L78 Accepts]: Start accepts. Automaton has 153896 states and 672395 transitions. Word has length 62 [2019-12-19 02:23:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:23:25,428 INFO L462 AbstractCegarLoop]: Abstraction has 153896 states and 672395 transitions. [2019-12-19 02:23:25,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:23:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 153896 states and 672395 transitions. [2019-12-19 02:23:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-19 02:23:25,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:23:25,468 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 02:23:25,468 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 02:23:25,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:23:25,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1587793502, now seen corresponding path program 1 times [2019-12-19 02:23:25,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:23:25,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376785222] [2019-12-19 02:23:25,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:23:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:23:25,627 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 02:23:25,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376785222] [2019-12-19 02:23:25,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:23:25,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:23:25,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926387995] [2019-12-19 02:23:25,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:23:25,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:23:25,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:23:25,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:23:25,629 INFO L87 Difference]: Start difference. First operand 153896 states and 672395 transitions. Second operand 6 states. [2019-12-19 02:23:33,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:23:33,782 INFO L93 Difference]: Finished difference Result 213000 states and 921027 transitions. [2019-12-19 02:23:33,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:23:33,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-19 02:23:33,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:23:34,518 INFO L225 Difference]: With dead ends: 213000 [2019-12-19 02:23:34,518 INFO L226 Difference]: Without dead ends: 209096 [2019-12-19 02:23:34,518 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 02:23:35,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209096 states. [2019-12-19 02:23:39,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209096 to 196108. [2019-12-19 02:23:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196108 states. [2019-12-19 02:23:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196108 states to 196108 states and 850978 transitions. [2019-12-19 02:23:40,460 INFO L78 Accepts]: Start accepts. Automaton has 196108 states and 850978 transitions. Word has length 62 [2019-12-19 02:23:40,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:23:40,460 INFO L462 AbstractCegarLoop]: Abstraction has 196108 states and 850978 transitions. [2019-12-19 02:23:40,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:23:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 196108 states and 850978 transitions. [2019-12-19 02:23:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-19 02:23:40,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:23:40,515 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 02:23:40,516 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 02:23:40,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:23:40,516 INFO L82 PathProgramCache]: Analyzing trace with hash 910222435, now seen corresponding path program 1 times [2019-12-19 02:23:40,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:23:40,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335773563] [2019-12-19 02:23:40,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:23:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:23:40,630 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 02:23:40,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335773563] [2019-12-19 02:23:40,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:23:40,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:23:40,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690698011] [2019-12-19 02:23:40,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:23:40,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:23:40,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:23:40,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:23:40,632 INFO L87 Difference]: Start difference. First operand 196108 states and 850978 transitions. Second operand 7 states. [2019-12-19 02:23:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:23:49,187 INFO L93 Difference]: Finished difference Result 284568 states and 1194511 transitions. [2019-12-19 02:23:49,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 02:23:49,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-19 02:23:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:23:50,185 INFO L225 Difference]: With dead ends: 284568 [2019-12-19 02:23:50,185 INFO L226 Difference]: Without dead ends: 284568 [2019-12-19 02:23:50,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:23:51,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284568 states. [2019-12-19 02:24:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284568 to 232540. [2019-12-19 02:24:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232540 states. [2019-12-19 02:24:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232540 states to 232540 states and 989998 transitions. [2019-12-19 02:24:03,462 INFO L78 Accepts]: Start accepts. Automaton has 232540 states and 989998 transitions. Word has length 62 [2019-12-19 02:24:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:03,463 INFO L462 AbstractCegarLoop]: Abstraction has 232540 states and 989998 transitions. [2019-12-19 02:24:03,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:24:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 232540 states and 989998 transitions. [2019-12-19 02:24:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-19 02:24:03,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:03,513 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 02:24:03,513 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 02:24:03,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:03,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1797726116, now seen corresponding path program 1 times [2019-12-19 02:24:03,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:03,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373813022] [2019-12-19 02:24:03,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:03,615 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 02:24:03,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373813022] [2019-12-19 02:24:03,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:03,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:24:03,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315586610] [2019-12-19 02:24:03,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:24:03,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:03,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:24:03,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:24:03,618 INFO L87 Difference]: Start difference. First operand 232540 states and 989998 transitions. Second operand 4 states. [2019-12-19 02:24:11,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:11,959 INFO L93 Difference]: Finished difference Result 189767 states and 786508 transitions. [2019-12-19 02:24:11,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:24:11,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-19 02:24:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:12,567 INFO L225 Difference]: With dead ends: 189767 [2019-12-19 02:24:12,567 INFO L226 Difference]: Without dead ends: 183771 [2019-12-19 02:24:12,568 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 02:24:13,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183771 states. [2019-12-19 02:24:16,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183771 to 183771. [2019-12-19 02:24:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183771 states. [2019-12-19 02:24:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183771 states to 183771 states and 765838 transitions. [2019-12-19 02:24:18,210 INFO L78 Accepts]: Start accepts. Automaton has 183771 states and 765838 transitions. Word has length 62 [2019-12-19 02:24:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:18,210 INFO L462 AbstractCegarLoop]: Abstraction has 183771 states and 765838 transitions. [2019-12-19 02:24:18,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:24:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 183771 states and 765838 transitions. [2019-12-19 02:24:18,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-19 02:24:18,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:18,252 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] [2019-12-19 02:24:18,252 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 02:24:18,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:18,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1299870988, now seen corresponding path program 1 times [2019-12-19 02:24:18,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:18,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478789780] [2019-12-19 02:24:18,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:18,359 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 02:24:18,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478789780] [2019-12-19 02:24:18,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:18,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:24:18,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939505813] [2019-12-19 02:24:18,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:24:18,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:18,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:24:18,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:24:18,362 INFO L87 Difference]: Start difference. First operand 183771 states and 765838 transitions. Second operand 5 states. [2019-12-19 02:24:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:18,568 INFO L93 Difference]: Finished difference Result 34884 states and 130108 transitions. [2019-12-19 02:24:18,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:24:18,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-19 02:24:18,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:18,636 INFO L225 Difference]: With dead ends: 34884 [2019-12-19 02:24:18,636 INFO L226 Difference]: Without dead ends: 30057 [2019-12-19 02:24:18,636 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 02:24:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30057 states. [2019-12-19 02:24:19,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30057 to 29865. [2019-12-19 02:24:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29865 states. [2019-12-19 02:24:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29865 states to 29865 states and 110398 transitions. [2019-12-19 02:24:24,696 INFO L78 Accepts]: Start accepts. Automaton has 29865 states and 110398 transitions. Word has length 63 [2019-12-19 02:24:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:24,697 INFO L462 AbstractCegarLoop]: Abstraction has 29865 states and 110398 transitions. [2019-12-19 02:24:24,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:24:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 29865 states and 110398 transitions. [2019-12-19 02:24:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-19 02:24:24,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:24,714 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] [2019-12-19 02:24:24,714 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 02:24:24,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:24,715 INFO L82 PathProgramCache]: Analyzing trace with hash -315278724, now seen corresponding path program 1 times [2019-12-19 02:24:24,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:24,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851081492] [2019-12-19 02:24:24,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:24,788 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 02:24:24,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851081492] [2019-12-19 02:24:24,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:24,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:24:24,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118261821] [2019-12-19 02:24:24,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:24:24,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:24,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:24:24,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:24:24,791 INFO L87 Difference]: Start difference. First operand 29865 states and 110398 transitions. Second operand 4 states. [2019-12-19 02:24:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:25,045 INFO L93 Difference]: Finished difference Result 34926 states and 128760 transitions. [2019-12-19 02:24:25,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:24:25,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-19 02:24:25,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:25,116 INFO L225 Difference]: With dead ends: 34926 [2019-12-19 02:24:25,116 INFO L226 Difference]: Without dead ends: 34926 [2019-12-19 02:24:25,116 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 02:24:25,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34926 states. [2019-12-19 02:24:25,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34926 to 31803. [2019-12-19 02:24:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31803 states. [2019-12-19 02:24:25,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31803 states to 31803 states and 117324 transitions. [2019-12-19 02:24:25,653 INFO L78 Accepts]: Start accepts. Automaton has 31803 states and 117324 transitions. Word has length 73 [2019-12-19 02:24:25,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:25,653 INFO L462 AbstractCegarLoop]: Abstraction has 31803 states and 117324 transitions. [2019-12-19 02:24:25,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:24:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand 31803 states and 117324 transitions. [2019-12-19 02:24:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-19 02:24:25,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:25,669 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] [2019-12-19 02:24:25,669 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 02:24:25,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:25,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1427531611, now seen corresponding path program 1 times [2019-12-19 02:24:25,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:25,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776781675] [2019-12-19 02:24:25,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:25,756 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 02:24:25,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776781675] [2019-12-19 02:24:25,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:25,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:24:25,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729014926] [2019-12-19 02:24:25,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:24:25,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:25,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:24:25,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:24:25,758 INFO L87 Difference]: Start difference. First operand 31803 states and 117324 transitions. Second operand 6 states. [2019-12-19 02:24:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:26,418 INFO L93 Difference]: Finished difference Result 40979 states and 149243 transitions. [2019-12-19 02:24:26,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 02:24:26,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-12-19 02:24:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:26,501 INFO L225 Difference]: With dead ends: 40979 [2019-12-19 02:24:26,501 INFO L226 Difference]: Without dead ends: 40799 [2019-12-19 02:24:26,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-19 02:24:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40799 states. [2019-12-19 02:24:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40799 to 34294. [2019-12-19 02:24:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34294 states. [2019-12-19 02:24:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34294 states to 34294 states and 125838 transitions. [2019-12-19 02:24:27,419 INFO L78 Accepts]: Start accepts. Automaton has 34294 states and 125838 transitions. Word has length 73 [2019-12-19 02:24:27,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:27,420 INFO L462 AbstractCegarLoop]: Abstraction has 34294 states and 125838 transitions. [2019-12-19 02:24:27,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:24:27,420 INFO L276 IsEmpty]: Start isEmpty. Operand 34294 states and 125838 transitions. [2019-12-19 02:24:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 02:24:27,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:27,440 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 02:24:27,440 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 02:24:27,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:27,441 INFO L82 PathProgramCache]: Analyzing trace with hash -671007420, now seen corresponding path program 1 times [2019-12-19 02:24:27,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:27,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624990329] [2019-12-19 02:24:27,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:27,515 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 02:24:27,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624990329] [2019-12-19 02:24:27,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:27,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:24:27,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869593893] [2019-12-19 02:24:27,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:24:27,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:27,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:24:27,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:24:27,518 INFO L87 Difference]: Start difference. First operand 34294 states and 125838 transitions. Second operand 4 states. [2019-12-19 02:24:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:27,907 INFO L93 Difference]: Finished difference Result 43212 states and 156687 transitions. [2019-12-19 02:24:27,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:24:27,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-19 02:24:27,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:27,995 INFO L225 Difference]: With dead ends: 43212 [2019-12-19 02:24:27,996 INFO L226 Difference]: Without dead ends: 43212 [2019-12-19 02:24:27,996 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 02:24:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43212 states. [2019-12-19 02:24:28,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43212 to 39522. [2019-12-19 02:24:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39522 states. [2019-12-19 02:24:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39522 states to 39522 states and 143619 transitions. [2019-12-19 02:24:29,005 INFO L78 Accepts]: Start accepts. Automaton has 39522 states and 143619 transitions. Word has length 75 [2019-12-19 02:24:29,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:29,006 INFO L462 AbstractCegarLoop]: Abstraction has 39522 states and 143619 transitions. [2019-12-19 02:24:29,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:24:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 39522 states and 143619 transitions. [2019-12-19 02:24:29,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 02:24:29,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:29,033 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 02:24:29,033 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 02:24:29,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:29,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1546750533, now seen corresponding path program 1 times [2019-12-19 02:24:29,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:29,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647093176] [2019-12-19 02:24:29,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:29,075 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 02:24:29,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647093176] [2019-12-19 02:24:29,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:29,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:24:29,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172670181] [2019-12-19 02:24:29,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:24:29,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:29,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:24:29,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:24:29,077 INFO L87 Difference]: Start difference. First operand 39522 states and 143619 transitions. Second operand 3 states. [2019-12-19 02:24:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:29,384 INFO L93 Difference]: Finished difference Result 41335 states and 149660 transitions. [2019-12-19 02:24:29,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:24:29,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-12-19 02:24:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:29,468 INFO L225 Difference]: With dead ends: 41335 [2019-12-19 02:24:29,468 INFO L226 Difference]: Without dead ends: 41335 [2019-12-19 02:24:29,468 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 02:24:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41335 states. [2019-12-19 02:24:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41335 to 40524. [2019-12-19 02:24:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40524 states. [2019-12-19 02:24:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40524 states to 40524 states and 146941 transitions. [2019-12-19 02:24:30,691 INFO L78 Accepts]: Start accepts. Automaton has 40524 states and 146941 transitions. Word has length 75 [2019-12-19 02:24:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:30,691 INFO L462 AbstractCegarLoop]: Abstraction has 40524 states and 146941 transitions. [2019-12-19 02:24:30,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:24:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 40524 states and 146941 transitions. [2019-12-19 02:24:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 02:24:30,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:30,725 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] [2019-12-19 02:24:30,725 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 02:24:30,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:30,725 INFO L82 PathProgramCache]: Analyzing trace with hash 935220688, now seen corresponding path program 1 times [2019-12-19 02:24:30,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:30,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293838804] [2019-12-19 02:24:30,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:30,860 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 02:24:30,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293838804] [2019-12-19 02:24:30,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:30,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:24:30,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030043937] [2019-12-19 02:24:30,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:24:30,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:30,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:24:30,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:24:30,863 INFO L87 Difference]: Start difference. First operand 40524 states and 146941 transitions. Second operand 6 states. [2019-12-19 02:24:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:31,506 INFO L93 Difference]: Finished difference Result 45113 states and 161733 transitions. [2019-12-19 02:24:31,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:24:31,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-12-19 02:24:31,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:31,597 INFO L225 Difference]: With dead ends: 45113 [2019-12-19 02:24:31,597 INFO L226 Difference]: Without dead ends: 45113 [2019-12-19 02:24:31,597 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 02:24:31,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45113 states. [2019-12-19 02:24:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45113 to 43400. [2019-12-19 02:24:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43400 states. [2019-12-19 02:24:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43400 states to 43400 states and 156064 transitions. [2019-12-19 02:24:32,308 INFO L78 Accepts]: Start accepts. Automaton has 43400 states and 156064 transitions. Word has length 77 [2019-12-19 02:24:32,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:32,308 INFO L462 AbstractCegarLoop]: Abstraction has 43400 states and 156064 transitions. [2019-12-19 02:24:32,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:24:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 43400 states and 156064 transitions. [2019-12-19 02:24:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 02:24:32,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:32,344 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] [2019-12-19 02:24:32,345 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 02:24:32,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:32,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1141988655, now seen corresponding path program 1 times [2019-12-19 02:24:32,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:32,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526641865] [2019-12-19 02:24:32,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:32,464 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 02:24:32,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526641865] [2019-12-19 02:24:32,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:32,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:24:32,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15229504] [2019-12-19 02:24:32,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:24:32,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:32,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:24:32,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:24:32,466 INFO L87 Difference]: Start difference. First operand 43400 states and 156064 transitions. Second operand 6 states. [2019-12-19 02:24:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:33,385 INFO L93 Difference]: Finished difference Result 51189 states and 179499 transitions. [2019-12-19 02:24:33,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:24:33,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-12-19 02:24:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:33,495 INFO L225 Difference]: With dead ends: 51189 [2019-12-19 02:24:33,495 INFO L226 Difference]: Without dead ends: 51189 [2019-12-19 02:24:33,495 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 02:24:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51189 states. [2019-12-19 02:24:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51189 to 45432. [2019-12-19 02:24:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45432 states. [2019-12-19 02:24:34,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45432 states to 45432 states and 160428 transitions. [2019-12-19 02:24:34,260 INFO L78 Accepts]: Start accepts. Automaton has 45432 states and 160428 transitions. Word has length 77 [2019-12-19 02:24:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:34,261 INFO L462 AbstractCegarLoop]: Abstraction has 45432 states and 160428 transitions. [2019-12-19 02:24:34,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:24:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 45432 states and 160428 transitions. [2019-12-19 02:24:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 02:24:34,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:34,297 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] [2019-12-19 02:24:34,297 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 02:24:34,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:34,298 INFO L82 PathProgramCache]: Analyzing trace with hash -930637742, now seen corresponding path program 1 times [2019-12-19 02:24:34,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:34,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432537225] [2019-12-19 02:24:34,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:34,363 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 02:24:34,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432537225] [2019-12-19 02:24:34,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:34,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:24:34,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285379150] [2019-12-19 02:24:34,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:24:34,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:34,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:24:34,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:24:34,365 INFO L87 Difference]: Start difference. First operand 45432 states and 160428 transitions. Second operand 5 states. [2019-12-19 02:24:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:34,896 INFO L93 Difference]: Finished difference Result 57021 states and 200693 transitions. [2019-12-19 02:24:34,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:24:34,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-19 02:24:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:35,444 INFO L225 Difference]: With dead ends: 57021 [2019-12-19 02:24:35,444 INFO L226 Difference]: Without dead ends: 57021 [2019-12-19 02:24:35,444 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 02:24:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57021 states. [2019-12-19 02:24:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57021 to 49071. [2019-12-19 02:24:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49071 states. [2019-12-19 02:24:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49071 states to 49071 states and 172039 transitions. [2019-12-19 02:24:36,241 INFO L78 Accepts]: Start accepts. Automaton has 49071 states and 172039 transitions. Word has length 77 [2019-12-19 02:24:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:36,242 INFO L462 AbstractCegarLoop]: Abstraction has 49071 states and 172039 transitions. [2019-12-19 02:24:36,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:24:36,242 INFO L276 IsEmpty]: Start isEmpty. Operand 49071 states and 172039 transitions. [2019-12-19 02:24:36,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 02:24:36,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:36,280 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] [2019-12-19 02:24:36,281 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 02:24:36,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:36,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1441171919, now seen corresponding path program 1 times [2019-12-19 02:24:36,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:36,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145484109] [2019-12-19 02:24:36,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:36,381 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 02:24:36,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145484109] [2019-12-19 02:24:36,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:36,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:24:36,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689021906] [2019-12-19 02:24:36,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:24:36,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:36,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:24:36,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:24:36,383 INFO L87 Difference]: Start difference. First operand 49071 states and 172039 transitions. Second operand 5 states. [2019-12-19 02:24:37,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:37,112 INFO L93 Difference]: Finished difference Result 64395 states and 225638 transitions. [2019-12-19 02:24:37,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:24:37,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-19 02:24:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:37,303 INFO L225 Difference]: With dead ends: 64395 [2019-12-19 02:24:37,303 INFO L226 Difference]: Without dead ends: 64395 [2019-12-19 02:24:37,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 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 02:24:37,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64395 states. [2019-12-19 02:24:38,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64395 to 51959. [2019-12-19 02:24:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51959 states. [2019-12-19 02:24:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51959 states to 51959 states and 182153 transitions. [2019-12-19 02:24:38,704 INFO L78 Accepts]: Start accepts. Automaton has 51959 states and 182153 transitions. Word has length 77 [2019-12-19 02:24:38,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:38,705 INFO L462 AbstractCegarLoop]: Abstraction has 51959 states and 182153 transitions. [2019-12-19 02:24:38,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:24:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 51959 states and 182153 transitions. [2019-12-19 02:24:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 02:24:38,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:38,744 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] [2019-12-19 02:24:38,744 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 02:24:38,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:38,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1046340914, now seen corresponding path program 1 times [2019-12-19 02:24:38,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:38,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983971859] [2019-12-19 02:24:38,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:38,821 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 02:24:38,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983971859] [2019-12-19 02:24:38,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:38,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:24:38,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551849755] [2019-12-19 02:24:38,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:24:38,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:38,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:24:38,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:24:38,828 INFO L87 Difference]: Start difference. First operand 51959 states and 182153 transitions. Second operand 6 states. [2019-12-19 02:24:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:38,988 INFO L93 Difference]: Finished difference Result 21143 states and 64322 transitions. [2019-12-19 02:24:38,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:24:38,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-12-19 02:24:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:39,023 INFO L225 Difference]: With dead ends: 21143 [2019-12-19 02:24:39,023 INFO L226 Difference]: Without dead ends: 17694 [2019-12-19 02:24:39,023 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 02:24:39,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17694 states. [2019-12-19 02:24:39,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17694 to 15290. [2019-12-19 02:24:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15290 states. [2019-12-19 02:24:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15290 states to 15290 states and 46304 transitions. [2019-12-19 02:24:39,234 INFO L78 Accepts]: Start accepts. Automaton has 15290 states and 46304 transitions. Word has length 77 [2019-12-19 02:24:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:39,235 INFO L462 AbstractCegarLoop]: Abstraction has 15290 states and 46304 transitions. [2019-12-19 02:24:39,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:24:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 15290 states and 46304 transitions. [2019-12-19 02:24:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 02:24:39,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:39,251 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 02:24:39,251 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 02:24:39,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:39,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1323973914, now seen corresponding path program 1 times [2019-12-19 02:24:39,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:39,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875130981] [2019-12-19 02:24:39,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:39,332 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 02:24:39,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875130981] [2019-12-19 02:24:39,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:39,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:24:39,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900897448] [2019-12-19 02:24:39,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:24:39,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:39,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:24:39,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:24:39,335 INFO L87 Difference]: Start difference. First operand 15290 states and 46304 transitions. Second operand 5 states. [2019-12-19 02:24:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:39,681 INFO L93 Difference]: Finished difference Result 17631 states and 52777 transitions. [2019-12-19 02:24:39,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:24:39,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-12-19 02:24:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:39,707 INFO L225 Difference]: With dead ends: 17631 [2019-12-19 02:24:39,707 INFO L226 Difference]: Without dead ends: 17507 [2019-12-19 02:24:39,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 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 02:24:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17507 states. [2019-12-19 02:24:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17507 to 15846. [2019-12-19 02:24:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15846 states. [2019-12-19 02:24:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15846 states to 15846 states and 47813 transitions. [2019-12-19 02:24:40,067 INFO L78 Accepts]: Start accepts. Automaton has 15846 states and 47813 transitions. Word has length 92 [2019-12-19 02:24:40,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:40,067 INFO L462 AbstractCegarLoop]: Abstraction has 15846 states and 47813 transitions. [2019-12-19 02:24:40,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:24:40,067 INFO L276 IsEmpty]: Start isEmpty. Operand 15846 states and 47813 transitions. [2019-12-19 02:24:40,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 02:24:40,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:40,086 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 02:24:40,086 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 02:24:40,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:40,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1945910238, now seen corresponding path program 2 times [2019-12-19 02:24:40,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:40,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427213729] [2019-12-19 02:24:40,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:40,199 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 02:24:40,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427213729] [2019-12-19 02:24:40,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:40,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:24:40,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060356509] [2019-12-19 02:24:40,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:24:40,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:40,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:24:40,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:24:40,202 INFO L87 Difference]: Start difference. First operand 15846 states and 47813 transitions. Second operand 7 states. [2019-12-19 02:24:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:40,811 INFO L93 Difference]: Finished difference Result 22406 states and 67119 transitions. [2019-12-19 02:24:40,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:24:40,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 02:24:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:40,842 INFO L225 Difference]: With dead ends: 22406 [2019-12-19 02:24:40,842 INFO L226 Difference]: Without dead ends: 22352 [2019-12-19 02:24:40,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-19 02:24:40,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22352 states. [2019-12-19 02:24:41,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22352 to 20008. [2019-12-19 02:24:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20008 states. [2019-12-19 02:24:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20008 states to 20008 states and 60256 transitions. [2019-12-19 02:24:41,137 INFO L78 Accepts]: Start accepts. Automaton has 20008 states and 60256 transitions. Word has length 92 [2019-12-19 02:24:41,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:41,137 INFO L462 AbstractCegarLoop]: Abstraction has 20008 states and 60256 transitions. [2019-12-19 02:24:41,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:24:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 20008 states and 60256 transitions. [2019-12-19 02:24:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 02:24:41,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:41,171 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 02:24:41,171 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 02:24:41,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:41,172 INFO L82 PathProgramCache]: Analyzing trace with hash 148958879, now seen corresponding path program 1 times [2019-12-19 02:24:41,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:41,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100835900] [2019-12-19 02:24:41,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:41,267 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 02:24:41,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100835900] [2019-12-19 02:24:41,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:41,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:24:41,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526764355] [2019-12-19 02:24:41,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:24:41,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:41,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:24:41,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:24:41,270 INFO L87 Difference]: Start difference. First operand 20008 states and 60256 transitions. Second operand 7 states. [2019-12-19 02:24:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:41,849 INFO L93 Difference]: Finished difference Result 28101 states and 84633 transitions. [2019-12-19 02:24:41,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 02:24:41,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 02:24:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:41,889 INFO L225 Difference]: With dead ends: 28101 [2019-12-19 02:24:41,890 INFO L226 Difference]: Without dead ends: 28101 [2019-12-19 02:24:41,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:24:41,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28101 states. [2019-12-19 02:24:42,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28101 to 21921. [2019-12-19 02:24:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21921 states. [2019-12-19 02:24:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21921 states to 21921 states and 66201 transitions. [2019-12-19 02:24:42,242 INFO L78 Accepts]: Start accepts. Automaton has 21921 states and 66201 transitions. Word has length 92 [2019-12-19 02:24:42,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:42,243 INFO L462 AbstractCegarLoop]: Abstraction has 21921 states and 66201 transitions. [2019-12-19 02:24:42,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:24:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 21921 states and 66201 transitions. [2019-12-19 02:24:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 02:24:42,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:42,270 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 02:24:42,270 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 02:24:42,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:42,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1036462560, now seen corresponding path program 1 times [2019-12-19 02:24:42,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:42,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898464537] [2019-12-19 02:24:42,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:42,375 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 02:24:42,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898464537] [2019-12-19 02:24:42,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:42,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:24:42,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242521713] [2019-12-19 02:24:42,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:24:42,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:42,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:24:42,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:24:42,379 INFO L87 Difference]: Start difference. First operand 21921 states and 66201 transitions. Second operand 6 states. [2019-12-19 02:24:42,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:42,762 INFO L93 Difference]: Finished difference Result 23956 states and 72004 transitions. [2019-12-19 02:24:42,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:24:42,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 02:24:42,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:42,796 INFO L225 Difference]: With dead ends: 23956 [2019-12-19 02:24:42,796 INFO L226 Difference]: Without dead ends: 23956 [2019-12-19 02:24:42,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:24:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23956 states. [2019-12-19 02:24:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23956 to 21633. [2019-12-19 02:24:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21633 states. [2019-12-19 02:24:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21633 states to 21633 states and 65389 transitions. [2019-12-19 02:24:43,268 INFO L78 Accepts]: Start accepts. Automaton has 21633 states and 65389 transitions. Word has length 92 [2019-12-19 02:24:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:43,269 INFO L462 AbstractCegarLoop]: Abstraction has 21633 states and 65389 transitions. [2019-12-19 02:24:43,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:24:43,269 INFO L276 IsEmpty]: Start isEmpty. Operand 21633 states and 65389 transitions. [2019-12-19 02:24:43,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 02:24:43,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:43,295 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 02:24:43,295 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:24:43,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:43,296 INFO L82 PathProgramCache]: Analyzing trace with hash -605612705, now seen corresponding path program 1 times [2019-12-19 02:24:43,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:43,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251532220] [2019-12-19 02:24:43,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:43,440 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 02:24:43,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251532220] [2019-12-19 02:24:43,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:43,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:24:43,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028858984] [2019-12-19 02:24:43,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:24:43,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:43,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:24:43,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:24:43,442 INFO L87 Difference]: Start difference. First operand 21633 states and 65389 transitions. Second operand 6 states. [2019-12-19 02:24:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:43,715 INFO L93 Difference]: Finished difference Result 21174 states and 63499 transitions. [2019-12-19 02:24:43,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:24:43,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 02:24:43,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:43,768 INFO L225 Difference]: With dead ends: 21174 [2019-12-19 02:24:43,769 INFO L226 Difference]: Without dead ends: 21174 [2019-12-19 02:24:43,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:24:43,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21174 states. [2019-12-19 02:24:44,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21174 to 10945. [2019-12-19 02:24:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10945 states. [2019-12-19 02:24:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10945 states to 10945 states and 33331 transitions. [2019-12-19 02:24:44,062 INFO L78 Accepts]: Start accepts. Automaton has 10945 states and 33331 transitions. Word has length 92 [2019-12-19 02:24:44,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:44,062 INFO L462 AbstractCegarLoop]: Abstraction has 10945 states and 33331 transitions. [2019-12-19 02:24:44,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:24:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 10945 states and 33331 transitions. [2019-12-19 02:24:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 02:24:44,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:44,075 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, 1, 1] [2019-12-19 02:24:44,075 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:24:44,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash -247317723, now seen corresponding path program 1 times [2019-12-19 02:24:44,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:44,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392747651] [2019-12-19 02:24:44,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:44,225 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 02:24:44,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392747651] [2019-12-19 02:24:44,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:44,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:24:44,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369113762] [2019-12-19 02:24:44,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:24:44,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:44,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:24:44,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:24:44,227 INFO L87 Difference]: Start difference. First operand 10945 states and 33331 transitions. Second operand 8 states. [2019-12-19 02:24:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:44,759 INFO L93 Difference]: Finished difference Result 12844 states and 38748 transitions. [2019-12-19 02:24:44,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 02:24:44,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-12-19 02:24:44,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:44,785 INFO L225 Difference]: With dead ends: 12844 [2019-12-19 02:24:44,786 INFO L226 Difference]: Without dead ends: 12844 [2019-12-19 02:24:44,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-12-19 02:24:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12844 states. [2019-12-19 02:24:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12844 to 12305. [2019-12-19 02:24:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12305 states. [2019-12-19 02:24:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12305 states to 12305 states and 37287 transitions. [2019-12-19 02:24:45,005 INFO L78 Accepts]: Start accepts. Automaton has 12305 states and 37287 transitions. Word has length 94 [2019-12-19 02:24:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:45,005 INFO L462 AbstractCegarLoop]: Abstraction has 12305 states and 37287 transitions. [2019-12-19 02:24:45,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:24:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 12305 states and 37287 transitions. [2019-12-19 02:24:45,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 02:24:45,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:45,017 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, 1, 1] [2019-12-19 02:24:45,017 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:24:45,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:45,018 INFO L82 PathProgramCache]: Analyzing trace with hash 640185958, now seen corresponding path program 1 times [2019-12-19 02:24:45,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:45,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026113285] [2019-12-19 02:24:45,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:45,184 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 02:24:45,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026113285] [2019-12-19 02:24:45,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:45,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 02:24:45,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685153845] [2019-12-19 02:24:45,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 02:24:45,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:45,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 02:24:45,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:24:45,186 INFO L87 Difference]: Start difference. First operand 12305 states and 37287 transitions. Second operand 9 states. [2019-12-19 02:24:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:46,143 INFO L93 Difference]: Finished difference Result 52566 states and 158203 transitions. [2019-12-19 02:24:46,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-19 02:24:46,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-19 02:24:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:46,217 INFO L225 Difference]: With dead ends: 52566 [2019-12-19 02:24:46,217 INFO L226 Difference]: Without dead ends: 33065 [2019-12-19 02:24:46,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-19 02:24:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33065 states. [2019-12-19 02:24:46,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33065 to 12767. [2019-12-19 02:24:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12767 states. [2019-12-19 02:24:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12767 states to 12767 states and 38426 transitions. [2019-12-19 02:24:46,503 INFO L78 Accepts]: Start accepts. Automaton has 12767 states and 38426 transitions. Word has length 94 [2019-12-19 02:24:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:46,504 INFO L462 AbstractCegarLoop]: Abstraction has 12767 states and 38426 transitions. [2019-12-19 02:24:46,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 02:24:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 12767 states and 38426 transitions. [2019-12-19 02:24:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 02:24:46,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:46,669 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, 1, 1] [2019-12-19 02:24:46,669 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:24:46,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:46,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1872976991, now seen corresponding path program 1 times [2019-12-19 02:24:46,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:46,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790918509] [2019-12-19 02:24:46,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:46,760 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 02:24:46,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790918509] [2019-12-19 02:24:46,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:46,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:24:46,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547409284] [2019-12-19 02:24:46,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:24:46,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:46,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:24:46,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:24:46,763 INFO L87 Difference]: Start difference. First operand 12767 states and 38426 transitions. Second operand 7 states. [2019-12-19 02:24:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:47,491 INFO L93 Difference]: Finished difference Result 15722 states and 46799 transitions. [2019-12-19 02:24:47,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 02:24:47,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-19 02:24:47,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:47,530 INFO L225 Difference]: With dead ends: 15722 [2019-12-19 02:24:47,530 INFO L226 Difference]: Without dead ends: 15598 [2019-12-19 02:24:47,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:24:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15598 states. [2019-12-19 02:24:47,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15598 to 13569. [2019-12-19 02:24:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13569 states. [2019-12-19 02:24:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13569 states to 13569 states and 40643 transitions. [2019-12-19 02:24:47,857 INFO L78 Accepts]: Start accepts. Automaton has 13569 states and 40643 transitions. Word has length 94 [2019-12-19 02:24:47,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:47,857 INFO L462 AbstractCegarLoop]: Abstraction has 13569 states and 40643 transitions. [2019-12-19 02:24:47,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:24:47,857 INFO L276 IsEmpty]: Start isEmpty. Operand 13569 states and 40643 transitions. [2019-12-19 02:24:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 02:24:47,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:47,873 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, 1, 1] [2019-12-19 02:24:47,873 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:24:47,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:47,874 INFO L82 PathProgramCache]: Analyzing trace with hash 344780962, now seen corresponding path program 2 times [2019-12-19 02:24:47,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:47,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776585626] [2019-12-19 02:24:47,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:48,012 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 02:24:48,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776585626] [2019-12-19 02:24:48,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:48,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:24:48,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384225039] [2019-12-19 02:24:48,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:24:48,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:48,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:24:48,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:24:48,014 INFO L87 Difference]: Start difference. First operand 13569 states and 40643 transitions. Second operand 8 states. [2019-12-19 02:24:48,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:48,241 INFO L93 Difference]: Finished difference Result 29631 states and 87927 transitions. [2019-12-19 02:24:48,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:24:48,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-12-19 02:24:48,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:48,269 INFO L225 Difference]: With dead ends: 29631 [2019-12-19 02:24:48,269 INFO L226 Difference]: Without dead ends: 17564 [2019-12-19 02:24:48,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-19 02:24:48,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17564 states. [2019-12-19 02:24:48,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17564 to 12044. [2019-12-19 02:24:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12044 states. [2019-12-19 02:24:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12044 states to 12044 states and 35801 transitions. [2019-12-19 02:24:48,454 INFO L78 Accepts]: Start accepts. Automaton has 12044 states and 35801 transitions. Word has length 94 [2019-12-19 02:24:48,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:48,454 INFO L462 AbstractCegarLoop]: Abstraction has 12044 states and 35801 transitions. [2019-12-19 02:24:48,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:24:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 12044 states and 35801 transitions. [2019-12-19 02:24:48,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 02:24:48,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:48,468 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, 1, 1] [2019-12-19 02:24:48,468 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:24:48,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:48,468 INFO L82 PathProgramCache]: Analyzing trace with hash -369153956, now seen corresponding path program 3 times [2019-12-19 02:24:48,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:48,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893330136] [2019-12-19 02:24:48,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:24:48,559 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 02:24:48,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893330136] [2019-12-19 02:24:48,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:24:48,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:24:48,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897506700] [2019-12-19 02:24:48,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:24:48,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:24:48,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:24:48,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:24:48,561 INFO L87 Difference]: Start difference. First operand 12044 states and 35801 transitions. Second operand 6 states. [2019-12-19 02:24:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:24:48,698 INFO L93 Difference]: Finished difference Result 19217 states and 56969 transitions. [2019-12-19 02:24:48,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:24:48,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-19 02:24:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:24:48,713 INFO L225 Difference]: With dead ends: 19217 [2019-12-19 02:24:48,713 INFO L226 Difference]: Without dead ends: 7402 [2019-12-19 02:24:48,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:24:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7402 states. [2019-12-19 02:24:48,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7402 to 7402. [2019-12-19 02:24:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7402 states. [2019-12-19 02:24:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7402 states to 7402 states and 21701 transitions. [2019-12-19 02:24:48,845 INFO L78 Accepts]: Start accepts. Automaton has 7402 states and 21701 transitions. Word has length 94 [2019-12-19 02:24:48,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:24:48,846 INFO L462 AbstractCegarLoop]: Abstraction has 7402 states and 21701 transitions. [2019-12-19 02:24:48,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:24:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 7402 states and 21701 transitions. [2019-12-19 02:24:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 02:24:48,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:24:48,861 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, 1, 1] [2019-12-19 02:24:48,861 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:24:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:24:48,861 INFO L82 PathProgramCache]: Analyzing trace with hash 907836508, now seen corresponding path program 4 times [2019-12-19 02:24:48,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:24:48,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534094846] [2019-12-19 02:24:48,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:24:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:24:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:24:48,964 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 02:24:48,964 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 02:24:49,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:24:49 BasicIcfg [2019-12-19 02:24:49,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 02:24:49,181 INFO L168 Benchmark]: Toolchain (without parser) took 165101.78 ms. Allocated memory was 145.8 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 102.6 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-19 02:24:49,181 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-19 02:24:49,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.00 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 102.1 MB in the beginning and 157.3 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-19 02:24:49,182 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.46 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 154.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-19 02:24:49,183 INFO L168 Benchmark]: Boogie Preprocessor took 46.05 ms. Allocated memory is still 202.9 MB. Free memory was 154.5 MB in the beginning and 152.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-19 02:24:49,183 INFO L168 Benchmark]: RCFGBuilder took 797.44 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 108.6 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-19 02:24:49,190 INFO L168 Benchmark]: TraceAbstraction took 163405.36 ms. Allocated memory was 202.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 108.6 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-19 02:24:49,193 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.53 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.00 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 102.1 MB in the beginning and 157.3 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.46 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 154.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.05 ms. Allocated memory is still 202.9 MB. Free memory was 154.5 MB in the beginning and 152.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 797.44 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 108.6 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 163405.36 ms. Allocated memory was 202.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 108.6 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.0 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L699] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L701] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L703] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L709] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L711] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L712] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L713] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L714] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L715] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L716] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L717] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L718] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L719] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t1004; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L821] 0 pthread_t t1005; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 0 pthread_t t1006; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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 [L791] 3 __unbuffered_p2_EAX = z [L794] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L733] 1 a = 1 [L736] 1 x = 1 [L741] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 2 [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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=1] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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=1] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, 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=1] [L797] 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=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, 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=1] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, 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=1] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, 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=1] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, 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=1] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, 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=1] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, 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=1] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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=1] [L763] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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=1] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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) [L798] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 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 [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L801] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 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 [L804] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 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) [L831] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 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 [L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L834] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L834] 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 [L837] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 162.9s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 67.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8437 SDtfs, 9174 SDslu, 22171 SDs, 0 SdLazy, 6206 SolverSat, 406 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 83 SyntacticMatches, 12 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232540occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 72.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 247728 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2232 NumberOfCodeBlocks, 2232 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2110 ConstructedInterpolants, 0 QuantifiedInterpolants, 453845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...