/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/mix034_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 02:08:09,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 02:08:09,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 02:08:09,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 02:08:09,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 02:08:09,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 02:08:09,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 02:08:09,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 02:08:09,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 02:08:09,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 02:08:09,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 02:08:09,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 02:08:09,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 02:08:09,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 02:08:09,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 02:08:09,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 02:08:09,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 02:08:09,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 02:08:09,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 02:08:09,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 02:08:09,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 02:08:09,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 02:08:09,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 02:08:09,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 02:08:09,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 02:08:09,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 02:08:09,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 02:08:09,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 02:08:09,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 02:08:09,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 02:08:09,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 02:08:09,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 02:08:09,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 02:08:09,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 02:08:09,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 02:08:09,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 02:08:09,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 02:08:09,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 02:08:09,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 02:08:09,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 02:08:09,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 02:08:09,923 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:08:09,937 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 02:08:09,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 02:08:09,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 02:08:09,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 02:08:09,939 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 02:08:09,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 02:08:09,939 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 02:08:09,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 02:08:09,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 02:08:09,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 02:08:09,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 02:08:09,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 02:08:09,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 02:08:09,940 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 02:08:09,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 02:08:09,941 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 02:08:09,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 02:08:09,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 02:08:09,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 02:08:09,942 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 02:08:09,942 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 02:08:09,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 02:08:09,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 02:08:09,943 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 02:08:09,943 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 02:08:09,943 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 02:08:09,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 02:08:09,943 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 02:08:09,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 02:08:09,944 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 02:08:10,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 02:08:10,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 02:08:10,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 02:08:10,248 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 02:08:10,249 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 02:08:10,250 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.opt.i [2019-12-19 02:08:10,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dbfff786/0211f152adfa4a45b1502268ee5540c6/FLAG8a1280c64 [2019-12-19 02:08:10,885 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 02:08:10,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.opt.i [2019-12-19 02:08:10,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dbfff786/0211f152adfa4a45b1502268ee5540c6/FLAG8a1280c64 [2019-12-19 02:08:11,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dbfff786/0211f152adfa4a45b1502268ee5540c6 [2019-12-19 02:08:11,150 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 02:08:11,152 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 02:08:11,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 02:08:11,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 02:08:11,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 02:08:11,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:08:11" (1/1) ... [2019-12-19 02:08:11,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5910708c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:11, skipping insertion in model container [2019-12-19 02:08:11,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:08:11" (1/1) ... [2019-12-19 02:08:11,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 02:08:11,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 02:08:11,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:08:11,749 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 02:08:11,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:08:11,906 INFO L208 MainTranslator]: Completed translation [2019-12-19 02:08:11,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:11 WrapperNode [2019-12-19 02:08:11,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 02:08:11,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 02:08:11,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 02:08:11,908 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 02:08:11,917 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:08:11" (1/1) ... [2019-12-19 02:08:11,937 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:08:11" (1/1) ... [2019-12-19 02:08:11,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 02:08:11,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 02:08:11,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 02:08:11,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 02:08:11,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:11" (1/1) ... [2019-12-19 02:08:11,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:11" (1/1) ... [2019-12-19 02:08:11,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:11" (1/1) ... [2019-12-19 02:08:11,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:11" (1/1) ... [2019-12-19 02:08:11,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:11" (1/1) ... [2019-12-19 02:08:12,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:11" (1/1) ... [2019-12-19 02:08:12,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:11" (1/1) ... [2019-12-19 02:08:12,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 02:08:12,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 02:08:12,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 02:08:12,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 02:08:12,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:11" (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:08:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 02:08:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 02:08:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 02:08:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 02:08:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 02:08:12,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 02:08:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 02:08:12,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 02:08:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 02:08:12,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 02:08:12,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 02:08:12,104 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:08:12,849 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 02:08:12,849 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 02:08:12,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:08:12 BoogieIcfgContainer [2019-12-19 02:08:12,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 02:08:12,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 02:08:12,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 02:08:12,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 02:08:12,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:08:11" (1/3) ... [2019-12-19 02:08:12,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a586162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:08:12, skipping insertion in model container [2019-12-19 02:08:12,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:11" (2/3) ... [2019-12-19 02:08:12,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a586162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:08:12, skipping insertion in model container [2019-12-19 02:08:12,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:08:12" (3/3) ... [2019-12-19 02:08:12,860 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_power.opt.i [2019-12-19 02:08:12,871 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 02:08:12,871 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 02:08:12,879 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 02:08:12,881 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 02:08:12,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,933 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,933 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,933 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,991 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,992 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,992 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:12,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:13,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:13,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:13,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:13,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:13,000 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:13,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:13,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:13,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:13,017 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 02:08:13,038 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 02:08:13,039 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 02:08:13,039 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 02:08:13,039 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 02:08:13,039 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 02:08:13,039 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 02:08:13,039 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 02:08:13,039 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 02:08:13,054 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149 places, 183 transitions [2019-12-19 02:08:15,117 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32593 states. [2019-12-19 02:08:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 32593 states. [2019-12-19 02:08:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-19 02:08:15,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:15,128 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] [2019-12-19 02:08:15,129 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:15,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:15,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1674583442, now seen corresponding path program 1 times [2019-12-19 02:08:15,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:15,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640910611] [2019-12-19 02:08:15,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:15,491 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:08:15,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640910611] [2019-12-19 02:08:15,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:15,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:08:15,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617272995] [2019-12-19 02:08:15,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:08:15,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:15,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:08:15,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:08:15,520 INFO L87 Difference]: Start difference. First operand 32593 states. Second operand 4 states. [2019-12-19 02:08:17,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:17,233 INFO L93 Difference]: Finished difference Result 33593 states and 129570 transitions. [2019-12-19 02:08:17,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:08:17,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-19 02:08:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:17,569 INFO L225 Difference]: With dead ends: 33593 [2019-12-19 02:08:17,570 INFO L226 Difference]: Without dead ends: 25705 [2019-12-19 02:08:17,583 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:08:17,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25705 states. [2019-12-19 02:08:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25705 to 25705. [2019-12-19 02:08:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25705 states. [2019-12-19 02:08:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25705 states to 25705 states and 99586 transitions. [2019-12-19 02:08:19,237 INFO L78 Accepts]: Start accepts. Automaton has 25705 states and 99586 transitions. Word has length 36 [2019-12-19 02:08:19,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:19,238 INFO L462 AbstractCegarLoop]: Abstraction has 25705 states and 99586 transitions. [2019-12-19 02:08:19,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:08:19,238 INFO L276 IsEmpty]: Start isEmpty. Operand 25705 states and 99586 transitions. [2019-12-19 02:08:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 02:08:19,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:19,247 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] [2019-12-19 02:08:19,247 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:19,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:19,248 INFO L82 PathProgramCache]: Analyzing trace with hash -196337745, now seen corresponding path program 1 times [2019-12-19 02:08:19,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:19,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741326439] [2019-12-19 02:08:19,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:19,438 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:08:19,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741326439] [2019-12-19 02:08:19,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:19,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:08:19,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910327544] [2019-12-19 02:08:19,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:08:19,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:19,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:08:19,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:08:19,444 INFO L87 Difference]: Start difference. First operand 25705 states and 99586 transitions. Second operand 5 states. [2019-12-19 02:08:20,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:20,504 INFO L93 Difference]: Finished difference Result 41083 states and 150433 transitions. [2019-12-19 02:08:20,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:08:20,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 02:08:20,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:20,699 INFO L225 Difference]: With dead ends: 41083 [2019-12-19 02:08:20,699 INFO L226 Difference]: Without dead ends: 40547 [2019-12-19 02:08:20,700 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:08:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40547 states. [2019-12-19 02:08:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40547 to 38927. [2019-12-19 02:08:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38927 states. [2019-12-19 02:08:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38927 states to 38927 states and 143583 transitions. [2019-12-19 02:08:23,382 INFO L78 Accepts]: Start accepts. Automaton has 38927 states and 143583 transitions. Word has length 48 [2019-12-19 02:08:23,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:23,384 INFO L462 AbstractCegarLoop]: Abstraction has 38927 states and 143583 transitions. [2019-12-19 02:08:23,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:08:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 38927 states and 143583 transitions. [2019-12-19 02:08:23,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 02:08:23,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:23,391 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] [2019-12-19 02:08:23,391 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:23,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:23,392 INFO L82 PathProgramCache]: Analyzing trace with hash -207257985, now seen corresponding path program 1 times [2019-12-19 02:08:23,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:23,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996098268] [2019-12-19 02:08:23,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:23,500 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:08:23,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996098268] [2019-12-19 02:08:23,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:23,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:08:23,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581238619] [2019-12-19 02:08:23,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:08:23,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:23,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:08:23,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:08:23,504 INFO L87 Difference]: Start difference. First operand 38927 states and 143583 transitions. Second operand 5 states. [2019-12-19 02:08:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:24,424 INFO L93 Difference]: Finished difference Result 49780 states and 180635 transitions. [2019-12-19 02:08:24,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:08:24,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-19 02:08:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:24,767 INFO L225 Difference]: With dead ends: 49780 [2019-12-19 02:08:24,767 INFO L226 Difference]: Without dead ends: 49276 [2019-12-19 02:08:24,768 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:08:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49276 states. [2019-12-19 02:08:27,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49276 to 42679. [2019-12-19 02:08:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42679 states. [2019-12-19 02:08:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42679 states to 42679 states and 156594 transitions. [2019-12-19 02:08:27,699 INFO L78 Accepts]: Start accepts. Automaton has 42679 states and 156594 transitions. Word has length 49 [2019-12-19 02:08:27,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:27,700 INFO L462 AbstractCegarLoop]: Abstraction has 42679 states and 156594 transitions. [2019-12-19 02:08:27,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:08:27,700 INFO L276 IsEmpty]: Start isEmpty. Operand 42679 states and 156594 transitions. [2019-12-19 02:08:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 02:08:27,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:27,710 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] [2019-12-19 02:08:27,710 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:27,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:27,710 INFO L82 PathProgramCache]: Analyzing trace with hash -635197403, now seen corresponding path program 1 times [2019-12-19 02:08:27,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:27,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045351218] [2019-12-19 02:08:27,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:27,759 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:08:27,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045351218] [2019-12-19 02:08:27,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:27,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:08:27,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285097858] [2019-12-19 02:08:27,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:08:27,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:27,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:08:27,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:08:27,761 INFO L87 Difference]: Start difference. First operand 42679 states and 156594 transitions. Second operand 3 states. [2019-12-19 02:08:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:28,425 INFO L93 Difference]: Finished difference Result 61089 states and 221432 transitions. [2019-12-19 02:08:28,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:08:28,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-19 02:08:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:28,641 INFO L225 Difference]: With dead ends: 61089 [2019-12-19 02:08:28,641 INFO L226 Difference]: Without dead ends: 61089 [2019-12-19 02:08:28,642 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:08:29,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61089 states. [2019-12-19 02:08:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61089 to 48018. [2019-12-19 02:08:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48018 states. [2019-12-19 02:08:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48018 states to 48018 states and 174181 transitions. [2019-12-19 02:08:31,599 INFO L78 Accepts]: Start accepts. Automaton has 48018 states and 174181 transitions. Word has length 51 [2019-12-19 02:08:31,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:31,600 INFO L462 AbstractCegarLoop]: Abstraction has 48018 states and 174181 transitions. [2019-12-19 02:08:31,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:08:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 48018 states and 174181 transitions. [2019-12-19 02:08:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:08:31,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:31,618 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:08:31,618 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:31,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:31,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1064293156, now seen corresponding path program 1 times [2019-12-19 02:08:31,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:31,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160525245] [2019-12-19 02:08:31,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:31,753 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:08:31,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160525245] [2019-12-19 02:08:31,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:31,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:08:31,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958111892] [2019-12-19 02:08:31,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:08:31,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:31,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:08:31,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:08:31,756 INFO L87 Difference]: Start difference. First operand 48018 states and 174181 transitions. Second operand 6 states. [2019-12-19 02:08:32,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:32,650 INFO L93 Difference]: Finished difference Result 63758 states and 229381 transitions. [2019-12-19 02:08:32,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:08:32,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 02:08:32,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:33,267 INFO L225 Difference]: With dead ends: 63758 [2019-12-19 02:08:33,267 INFO L226 Difference]: Without dead ends: 63758 [2019-12-19 02:08:33,268 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:08:33,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63758 states. [2019-12-19 02:08:36,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63758 to 59951. [2019-12-19 02:08:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59951 states. [2019-12-19 02:08:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59951 states to 59951 states and 215674 transitions. [2019-12-19 02:08:36,898 INFO L78 Accepts]: Start accepts. Automaton has 59951 states and 215674 transitions. Word has length 55 [2019-12-19 02:08:36,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:36,898 INFO L462 AbstractCegarLoop]: Abstraction has 59951 states and 215674 transitions. [2019-12-19 02:08:36,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:08:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 59951 states and 215674 transitions. [2019-12-19 02:08:36,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:08:36,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:36,916 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:08:36,916 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:36,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:36,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1433722781, now seen corresponding path program 1 times [2019-12-19 02:08:36,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:36,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750315092] [2019-12-19 02:08:36,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:37,037 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:08:37,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750315092] [2019-12-19 02:08:37,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:37,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:08:37,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279328841] [2019-12-19 02:08:37,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:08:37,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:37,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:08:37,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:08:37,040 INFO L87 Difference]: Start difference. First operand 59951 states and 215674 transitions. Second operand 7 states. [2019-12-19 02:08:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:38,382 INFO L93 Difference]: Finished difference Result 83687 states and 290099 transitions. [2019-12-19 02:08:38,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 02:08:38,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-19 02:08:38,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:38,569 INFO L225 Difference]: With dead ends: 83687 [2019-12-19 02:08:38,569 INFO L226 Difference]: Without dead ends: 83687 [2019-12-19 02:08:38,570 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:08:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83687 states. [2019-12-19 02:08:40,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83687 to 71014. [2019-12-19 02:08:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71014 states. [2019-12-19 02:08:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71014 states to 71014 states and 249888 transitions. [2019-12-19 02:08:43,844 INFO L78 Accepts]: Start accepts. Automaton has 71014 states and 249888 transitions. Word has length 55 [2019-12-19 02:08:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:43,844 INFO L462 AbstractCegarLoop]: Abstraction has 71014 states and 249888 transitions. [2019-12-19 02:08:43,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:08:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 71014 states and 249888 transitions. [2019-12-19 02:08:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:08:43,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:43,858 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:08:43,858 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:43,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:43,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1973740834, now seen corresponding path program 1 times [2019-12-19 02:08:43,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:43,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65848718] [2019-12-19 02:08:43,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:43,940 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:08:43,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65848718] [2019-12-19 02:08:43,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:43,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:08:43,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149035057] [2019-12-19 02:08:43,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:08:43,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:43,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:08:43,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:08:43,943 INFO L87 Difference]: Start difference. First operand 71014 states and 249888 transitions. Second operand 4 states. [2019-12-19 02:08:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:44,025 INFO L93 Difference]: Finished difference Result 12161 states and 37831 transitions. [2019-12-19 02:08:44,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:08:44,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-19 02:08:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:44,057 INFO L225 Difference]: With dead ends: 12161 [2019-12-19 02:08:44,058 INFO L226 Difference]: Without dead ends: 10676 [2019-12-19 02:08:44,058 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:08:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10676 states. [2019-12-19 02:08:44,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10676 to 10627. [2019-12-19 02:08:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10627 states. [2019-12-19 02:08:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10627 states to 10627 states and 32593 transitions. [2019-12-19 02:08:44,232 INFO L78 Accepts]: Start accepts. Automaton has 10627 states and 32593 transitions. Word has length 55 [2019-12-19 02:08:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:44,233 INFO L462 AbstractCegarLoop]: Abstraction has 10627 states and 32593 transitions. [2019-12-19 02:08:44,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:08:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 10627 states and 32593 transitions. [2019-12-19 02:08:44,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:08:44,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:44,234 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:08:44,234 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:44,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:44,235 INFO L82 PathProgramCache]: Analyzing trace with hash -984017040, now seen corresponding path program 1 times [2019-12-19 02:08:44,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:44,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291030766] [2019-12-19 02:08:44,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:44,298 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:08:44,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291030766] [2019-12-19 02:08:44,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:44,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:08:44,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093782346] [2019-12-19 02:08:44,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:08:44,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:44,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:08:44,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:08:44,301 INFO L87 Difference]: Start difference. First operand 10627 states and 32593 transitions. Second operand 6 states. [2019-12-19 02:08:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:44,773 INFO L93 Difference]: Finished difference Result 13184 states and 39874 transitions. [2019-12-19 02:08:44,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:08:44,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 02:08:44,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:44,802 INFO L225 Difference]: With dead ends: 13184 [2019-12-19 02:08:44,802 INFO L226 Difference]: Without dead ends: 13121 [2019-12-19 02:08:44,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-19 02:08:44,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13121 states. [2019-12-19 02:08:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13121 to 11050. [2019-12-19 02:08:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11050 states. [2019-12-19 02:08:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11050 states to 11050 states and 33787 transitions. [2019-12-19 02:08:45,010 INFO L78 Accepts]: Start accepts. Automaton has 11050 states and 33787 transitions. Word has length 55 [2019-12-19 02:08:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:45,010 INFO L462 AbstractCegarLoop]: Abstraction has 11050 states and 33787 transitions. [2019-12-19 02:08:45,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:08:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 11050 states and 33787 transitions. [2019-12-19 02:08:45,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-19 02:08:45,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:45,015 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:08:45,015 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:45,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:45,015 INFO L82 PathProgramCache]: Analyzing trace with hash 721551436, now seen corresponding path program 1 times [2019-12-19 02:08:45,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:45,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122270363] [2019-12-19 02:08:45,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:45,083 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:08:45,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122270363] [2019-12-19 02:08:45,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:45,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:08:45,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296661025] [2019-12-19 02:08:45,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:08:45,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:45,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:08:45,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:08:45,086 INFO L87 Difference]: Start difference. First operand 11050 states and 33787 transitions. Second operand 4 states. [2019-12-19 02:08:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:45,223 INFO L93 Difference]: Finished difference Result 12864 states and 39393 transitions. [2019-12-19 02:08:45,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:08:45,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-19 02:08:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:45,251 INFO L225 Difference]: With dead ends: 12864 [2019-12-19 02:08:45,251 INFO L226 Difference]: Without dead ends: 12864 [2019-12-19 02:08:45,252 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:08:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12864 states. [2019-12-19 02:08:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12864 to 11695. [2019-12-19 02:08:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11695 states. [2019-12-19 02:08:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11695 states to 11695 states and 35764 transitions. [2019-12-19 02:08:45,504 INFO L78 Accepts]: Start accepts. Automaton has 11695 states and 35764 transitions. Word has length 63 [2019-12-19 02:08:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:45,504 INFO L462 AbstractCegarLoop]: Abstraction has 11695 states and 35764 transitions. [2019-12-19 02:08:45,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:08:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 11695 states and 35764 transitions. [2019-12-19 02:08:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-19 02:08:45,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:45,510 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:08:45,510 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:45,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:45,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1830605525, now seen corresponding path program 1 times [2019-12-19 02:08:45,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:45,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974568792] [2019-12-19 02:08:45,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:45,570 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:08:45,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974568792] [2019-12-19 02:08:45,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:45,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:08:45,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743382032] [2019-12-19 02:08:45,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:08:45,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:45,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:08:45,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:08:45,572 INFO L87 Difference]: Start difference. First operand 11695 states and 35764 transitions. Second operand 6 states. [2019-12-19 02:08:46,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:46,003 INFO L93 Difference]: Finished difference Result 14221 states and 42862 transitions. [2019-12-19 02:08:46,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:08:46,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-19 02:08:46,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:46,024 INFO L225 Difference]: With dead ends: 14221 [2019-12-19 02:08:46,024 INFO L226 Difference]: Without dead ends: 14160 [2019-12-19 02:08:46,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:08:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14160 states. [2019-12-19 02:08:46,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14160 to 13463. [2019-12-19 02:08:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13463 states. [2019-12-19 02:08:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13463 states to 13463 states and 40781 transitions. [2019-12-19 02:08:46,309 INFO L78 Accepts]: Start accepts. Automaton has 13463 states and 40781 transitions. Word has length 63 [2019-12-19 02:08:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:46,309 INFO L462 AbstractCegarLoop]: Abstraction has 13463 states and 40781 transitions. [2019-12-19 02:08:46,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:08:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 13463 states and 40781 transitions. [2019-12-19 02:08:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 02:08:46,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:46,317 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] [2019-12-19 02:08:46,317 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:46,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:46,318 INFO L82 PathProgramCache]: Analyzing trace with hash -827165457, now seen corresponding path program 1 times [2019-12-19 02:08:46,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:46,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983488027] [2019-12-19 02:08:46,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:46,367 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:08:46,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983488027] [2019-12-19 02:08:46,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:46,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:08:46,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609016939] [2019-12-19 02:08:46,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:08:46,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:46,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:08:46,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:08:46,370 INFO L87 Difference]: Start difference. First operand 13463 states and 40781 transitions. Second operand 3 states. [2019-12-19 02:08:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:46,616 INFO L93 Difference]: Finished difference Result 14051 states and 42317 transitions. [2019-12-19 02:08:46,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:08:46,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-19 02:08:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:46,637 INFO L225 Difference]: With dead ends: 14051 [2019-12-19 02:08:46,637 INFO L226 Difference]: Without dead ends: 14051 [2019-12-19 02:08:46,638 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:08:46,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14051 states. [2019-12-19 02:08:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14051 to 13757. [2019-12-19 02:08:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13757 states. [2019-12-19 02:08:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13757 states to 13757 states and 41549 transitions. [2019-12-19 02:08:46,819 INFO L78 Accepts]: Start accepts. Automaton has 13757 states and 41549 transitions. Word has length 67 [2019-12-19 02:08:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:46,819 INFO L462 AbstractCegarLoop]: Abstraction has 13757 states and 41549 transitions. [2019-12-19 02:08:46,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:08:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 13757 states and 41549 transitions. [2019-12-19 02:08:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 02:08:46,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:46,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:08:46,827 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:46,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:46,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1250043886, now seen corresponding path program 1 times [2019-12-19 02:08:46,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:46,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449833460] [2019-12-19 02:08:46,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:46,889 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:08:46,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449833460] [2019-12-19 02:08:46,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:46,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:08:46,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199557836] [2019-12-19 02:08:46,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:08:46,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:46,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:08:46,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:08:46,891 INFO L87 Difference]: Start difference. First operand 13757 states and 41549 transitions. Second operand 4 states. [2019-12-19 02:08:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:47,187 INFO L93 Difference]: Finished difference Result 16799 states and 50141 transitions. [2019-12-19 02:08:47,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:08:47,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 02:08:47,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:47,211 INFO L225 Difference]: With dead ends: 16799 [2019-12-19 02:08:47,211 INFO L226 Difference]: Without dead ends: 16799 [2019-12-19 02:08:47,211 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:08:47,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16799 states. [2019-12-19 02:08:47,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16799 to 15278. [2019-12-19 02:08:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15278 states. [2019-12-19 02:08:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15278 states to 15278 states and 45730 transitions. [2019-12-19 02:08:47,406 INFO L78 Accepts]: Start accepts. Automaton has 15278 states and 45730 transitions. Word has length 67 [2019-12-19 02:08:47,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:47,406 INFO L462 AbstractCegarLoop]: Abstraction has 15278 states and 45730 transitions. [2019-12-19 02:08:47,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:08:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 15278 states and 45730 transitions. [2019-12-19 02:08:47,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:08:47,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:47,415 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] [2019-12-19 02:08:47,415 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:47,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:47,415 INFO L82 PathProgramCache]: Analyzing trace with hash -750353405, now seen corresponding path program 1 times [2019-12-19 02:08:47,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:47,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144170375] [2019-12-19 02:08:47,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:47,532 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:08:47,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144170375] [2019-12-19 02:08:47,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:47,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:08:47,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572449019] [2019-12-19 02:08:47,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:08:47,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:47,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:08:47,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:08:47,533 INFO L87 Difference]: Start difference. First operand 15278 states and 45730 transitions. Second operand 6 states. [2019-12-19 02:08:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:48,146 INFO L93 Difference]: Finished difference Result 16275 states and 48105 transitions. [2019-12-19 02:08:48,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:08:48,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-19 02:08:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:48,169 INFO L225 Difference]: With dead ends: 16275 [2019-12-19 02:08:48,170 INFO L226 Difference]: Without dead ends: 16275 [2019-12-19 02:08:48,170 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:08:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2019-12-19 02:08:48,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 15851. [2019-12-19 02:08:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15851 states. [2019-12-19 02:08:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15851 states to 15851 states and 47027 transitions. [2019-12-19 02:08:48,487 INFO L78 Accepts]: Start accepts. Automaton has 15851 states and 47027 transitions. Word has length 69 [2019-12-19 02:08:48,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:48,488 INFO L462 AbstractCegarLoop]: Abstraction has 15851 states and 47027 transitions. [2019-12-19 02:08:48,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:08:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 15851 states and 47027 transitions. [2019-12-19 02:08:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:08:48,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:48,497 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] [2019-12-19 02:08:48,497 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:48,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:48,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1467404548, now seen corresponding path program 1 times [2019-12-19 02:08:48,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:48,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783039951] [2019-12-19 02:08:48,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:48,584 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:08:48,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783039951] [2019-12-19 02:08:48,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:48,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:08:48,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889705473] [2019-12-19 02:08:48,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:08:48,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:48,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:08:48,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:08:48,586 INFO L87 Difference]: Start difference. First operand 15851 states and 47027 transitions. Second operand 6 states. [2019-12-19 02:08:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:49,116 INFO L93 Difference]: Finished difference Result 18162 states and 52355 transitions. [2019-12-19 02:08:49,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:08:49,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-19 02:08:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:49,142 INFO L225 Difference]: With dead ends: 18162 [2019-12-19 02:08:49,142 INFO L226 Difference]: Without dead ends: 18162 [2019-12-19 02:08:49,142 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:08:49,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18162 states. [2019-12-19 02:08:49,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18162 to 16543. [2019-12-19 02:08:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16543 states. [2019-12-19 02:08:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16543 states to 16543 states and 48247 transitions. [2019-12-19 02:08:49,366 INFO L78 Accepts]: Start accepts. Automaton has 16543 states and 48247 transitions. Word has length 69 [2019-12-19 02:08:49,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:49,366 INFO L462 AbstractCegarLoop]: Abstraction has 16543 states and 48247 transitions. [2019-12-19 02:08:49,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:08:49,366 INFO L276 IsEmpty]: Start isEmpty. Operand 16543 states and 48247 transitions. [2019-12-19 02:08:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:08:49,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:49,376 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] [2019-12-19 02:08:49,376 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:49,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:49,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1678755461, now seen corresponding path program 1 times [2019-12-19 02:08:49,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:49,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723769089] [2019-12-19 02:08:49,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:49,476 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:08:49,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723769089] [2019-12-19 02:08:49,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:49,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:08:49,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622809438] [2019-12-19 02:08:49,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:08:49,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:49,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:08:49,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:08:49,478 INFO L87 Difference]: Start difference. First operand 16543 states and 48247 transitions. Second operand 5 states. [2019-12-19 02:08:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:49,906 INFO L93 Difference]: Finished difference Result 21457 states and 62487 transitions. [2019-12-19 02:08:49,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:08:49,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 02:08:49,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:49,940 INFO L225 Difference]: With dead ends: 21457 [2019-12-19 02:08:49,941 INFO L226 Difference]: Without dead ends: 21457 [2019-12-19 02:08:49,941 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:08:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21457 states. [2019-12-19 02:08:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21457 to 19522. [2019-12-19 02:08:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19522 states. [2019-12-19 02:08:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19522 states to 19522 states and 56656 transitions. [2019-12-19 02:08:50,208 INFO L78 Accepts]: Start accepts. Automaton has 19522 states and 56656 transitions. Word has length 69 [2019-12-19 02:08:50,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:50,208 INFO L462 AbstractCegarLoop]: Abstraction has 19522 states and 56656 transitions. [2019-12-19 02:08:50,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:08:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 19522 states and 56656 transitions. [2019-12-19 02:08:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:08:50,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:50,220 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] [2019-12-19 02:08:50,220 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:50,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:50,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1168221284, now seen corresponding path program 1 times [2019-12-19 02:08:50,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:50,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976208174] [2019-12-19 02:08:50,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:50,288 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:08:50,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976208174] [2019-12-19 02:08:50,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:50,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:08:50,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814087239] [2019-12-19 02:08:50,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:08:50,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:50,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:08:50,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:08:50,290 INFO L87 Difference]: Start difference. First operand 19522 states and 56656 transitions. Second operand 5 states. [2019-12-19 02:08:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:51,006 INFO L93 Difference]: Finished difference Result 26409 states and 76314 transitions. [2019-12-19 02:08:51,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:08:51,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 02:08:51,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:51,042 INFO L225 Difference]: With dead ends: 26409 [2019-12-19 02:08:51,042 INFO L226 Difference]: Without dead ends: 26409 [2019-12-19 02:08:51,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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:08:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26409 states. [2019-12-19 02:08:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26409 to 21410. [2019-12-19 02:08:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-19 02:08:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 61930 transitions. [2019-12-19 02:08:51,343 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 61930 transitions. Word has length 69 [2019-12-19 02:08:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:51,343 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 61930 transitions. [2019-12-19 02:08:51,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:08:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 61930 transitions. [2019-12-19 02:08:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:08:51,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:51,355 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] [2019-12-19 02:08:51,355 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:51,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:51,355 INFO L82 PathProgramCache]: Analyzing trace with hash -639233179, now seen corresponding path program 1 times [2019-12-19 02:08:51,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:51,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059932113] [2019-12-19 02:08:51,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:51,399 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:08:51,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059932113] [2019-12-19 02:08:51,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:51,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:08:51,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374952679] [2019-12-19 02:08:51,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:08:51,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:51,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:08:51,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:08:51,401 INFO L87 Difference]: Start difference. First operand 21410 states and 61930 transitions. Second operand 4 states. [2019-12-19 02:08:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:52,105 INFO L93 Difference]: Finished difference Result 27971 states and 81352 transitions. [2019-12-19 02:08:52,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:08:52,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-19 02:08:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:52,147 INFO L225 Difference]: With dead ends: 27971 [2019-12-19 02:08:52,147 INFO L226 Difference]: Without dead ends: 27836 [2019-12-19 02:08:52,147 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:08:52,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27836 states. [2019-12-19 02:08:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27836 to 25847. [2019-12-19 02:08:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25847 states. [2019-12-19 02:08:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25847 states to 25847 states and 75190 transitions. [2019-12-19 02:08:52,506 INFO L78 Accepts]: Start accepts. Automaton has 25847 states and 75190 transitions. Word has length 69 [2019-12-19 02:08:52,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:52,506 INFO L462 AbstractCegarLoop]: Abstraction has 25847 states and 75190 transitions. [2019-12-19 02:08:52,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:08:52,506 INFO L276 IsEmpty]: Start isEmpty. Operand 25847 states and 75190 transitions. [2019-12-19 02:08:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:08:52,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:52,516 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] [2019-12-19 02:08:52,516 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:52,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:52,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1858782758, now seen corresponding path program 1 times [2019-12-19 02:08:52,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:52,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196864991] [2019-12-19 02:08:52,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:52,665 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:08:52,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196864991] [2019-12-19 02:08:52,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:52,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 02:08:52,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309215877] [2019-12-19 02:08:52,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 02:08:52,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:52,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 02:08:52,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:08:52,667 INFO L87 Difference]: Start difference. First operand 25847 states and 75190 transitions. Second operand 9 states. [2019-12-19 02:08:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:54,050 INFO L93 Difference]: Finished difference Result 32127 states and 92914 transitions. [2019-12-19 02:08:54,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 02:08:54,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-12-19 02:08:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:54,096 INFO L225 Difference]: With dead ends: 32127 [2019-12-19 02:08:54,096 INFO L226 Difference]: Without dead ends: 32127 [2019-12-19 02:08:54,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:08:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32127 states. [2019-12-19 02:08:54,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32127 to 28383. [2019-12-19 02:08:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28383 states. [2019-12-19 02:08:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28383 states to 28383 states and 82403 transitions. [2019-12-19 02:08:54,483 INFO L78 Accepts]: Start accepts. Automaton has 28383 states and 82403 transitions. Word has length 69 [2019-12-19 02:08:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:54,484 INFO L462 AbstractCegarLoop]: Abstraction has 28383 states and 82403 transitions. [2019-12-19 02:08:54,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 02:08:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 28383 states and 82403 transitions. [2019-12-19 02:08:54,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:08:54,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:54,493 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] [2019-12-19 02:08:54,493 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:54,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:54,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1548680857, now seen corresponding path program 1 times [2019-12-19 02:08:54,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:54,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786095618] [2019-12-19 02:08:54,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:54,579 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:08:54,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786095618] [2019-12-19 02:08:54,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:54,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:08:54,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999219321] [2019-12-19 02:08:54,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:08:54,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:54,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:08:54,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:08:54,582 INFO L87 Difference]: Start difference. First operand 28383 states and 82403 transitions. Second operand 5 states. [2019-12-19 02:08:54,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:54,634 INFO L93 Difference]: Finished difference Result 7794 states and 18427 transitions. [2019-12-19 02:08:54,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:08:54,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 02:08:54,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:54,642 INFO L225 Difference]: With dead ends: 7794 [2019-12-19 02:08:54,642 INFO L226 Difference]: Without dead ends: 6492 [2019-12-19 02:08:54,643 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:08:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6492 states. [2019-12-19 02:08:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6492 to 5192. [2019-12-19 02:08:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5192 states. [2019-12-19 02:08:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5192 states to 5192 states and 11976 transitions. [2019-12-19 02:08:54,702 INFO L78 Accepts]: Start accepts. Automaton has 5192 states and 11976 transitions. Word has length 69 [2019-12-19 02:08:54,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:54,702 INFO L462 AbstractCegarLoop]: Abstraction has 5192 states and 11976 transitions. [2019-12-19 02:08:54,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:08:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 5192 states and 11976 transitions. [2019-12-19 02:08:54,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:08:54,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:54,706 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] [2019-12-19 02:08:54,706 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash -839136164, now seen corresponding path program 1 times [2019-12-19 02:08:54,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:54,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613994491] [2019-12-19 02:08:54,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:54,738 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:08:54,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613994491] [2019-12-19 02:08:54,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:54,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:08:54,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978103618] [2019-12-19 02:08:54,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:08:54,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:54,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:08:54,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:08:54,740 INFO L87 Difference]: Start difference. First operand 5192 states and 11976 transitions. Second operand 3 states. [2019-12-19 02:08:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:54,790 INFO L93 Difference]: Finished difference Result 6814 states and 15573 transitions. [2019-12-19 02:08:54,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:08:54,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-19 02:08:54,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:54,801 INFO L225 Difference]: With dead ends: 6814 [2019-12-19 02:08:54,801 INFO L226 Difference]: Without dead ends: 6814 [2019-12-19 02:08:54,802 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:08:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6814 states. [2019-12-19 02:08:54,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6814 to 5115. [2019-12-19 02:08:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5115 states. [2019-12-19 02:08:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 11523 transitions. [2019-12-19 02:08:54,880 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 11523 transitions. Word has length 69 [2019-12-19 02:08:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:54,881 INFO L462 AbstractCegarLoop]: Abstraction has 5115 states and 11523 transitions. [2019-12-19 02:08:54,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:08:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 11523 transitions. [2019-12-19 02:08:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 02:08:54,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:54,885 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:08:54,885 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:54,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:54,885 INFO L82 PathProgramCache]: Analyzing trace with hash -537618065, now seen corresponding path program 1 times [2019-12-19 02:08:54,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:54,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912000152] [2019-12-19 02:08:54,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:54,937 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:08:54,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912000152] [2019-12-19 02:08:54,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:54,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:08:54,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988541296] [2019-12-19 02:08:54,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:08:54,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:54,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:08:54,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:08:54,939 INFO L87 Difference]: Start difference. First operand 5115 states and 11523 transitions. Second operand 5 states. [2019-12-19 02:08:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:55,122 INFO L93 Difference]: Finished difference Result 6192 states and 13988 transitions. [2019-12-19 02:08:55,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:08:55,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-19 02:08:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:55,130 INFO L225 Difference]: With dead ends: 6192 [2019-12-19 02:08:55,131 INFO L226 Difference]: Without dead ends: 6192 [2019-12-19 02:08:55,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:08:55,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6192 states. [2019-12-19 02:08:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6192 to 5535. [2019-12-19 02:08:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5535 states. [2019-12-19 02:08:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 12481 transitions. [2019-12-19 02:08:55,193 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 12481 transitions. Word has length 75 [2019-12-19 02:08:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:55,193 INFO L462 AbstractCegarLoop]: Abstraction has 5535 states and 12481 transitions. [2019-12-19 02:08:55,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:08:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 12481 transitions. [2019-12-19 02:08:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 02:08:55,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:55,198 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:08:55,198 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:55,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:55,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1205192270, now seen corresponding path program 1 times [2019-12-19 02:08:55,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:55,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320940024] [2019-12-19 02:08:55,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:55,258 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:08:55,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320940024] [2019-12-19 02:08:55,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:55,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:08:55,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365275503] [2019-12-19 02:08:55,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:08:55,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:55,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:08:55,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:08:55,261 INFO L87 Difference]: Start difference. First operand 5535 states and 12481 transitions. Second operand 7 states. [2019-12-19 02:08:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:55,743 INFO L93 Difference]: Finished difference Result 6346 states and 14202 transitions. [2019-12-19 02:08:55,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:08:55,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-19 02:08:55,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:55,752 INFO L225 Difference]: With dead ends: 6346 [2019-12-19 02:08:55,752 INFO L226 Difference]: Without dead ends: 6293 [2019-12-19 02:08:55,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-19 02:08:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6293 states. [2019-12-19 02:08:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6293 to 5566. [2019-12-19 02:08:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5566 states. [2019-12-19 02:08:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5566 states to 5566 states and 12481 transitions. [2019-12-19 02:08:55,811 INFO L78 Accepts]: Start accepts. Automaton has 5566 states and 12481 transitions. Word has length 75 [2019-12-19 02:08:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:55,811 INFO L462 AbstractCegarLoop]: Abstraction has 5566 states and 12481 transitions. [2019-12-19 02:08:55,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:08:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5566 states and 12481 transitions. [2019-12-19 02:08:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 02:08:55,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:55,816 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:08:55,816 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:55,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:55,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1794925312, now seen corresponding path program 1 times [2019-12-19 02:08:55,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:55,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120286590] [2019-12-19 02:08:55,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:55,879 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:08:55,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120286590] [2019-12-19 02:08:55,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:55,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:08:55,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099064350] [2019-12-19 02:08:55,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:08:55,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:55,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:08:55,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:08:55,886 INFO L87 Difference]: Start difference. First operand 5566 states and 12481 transitions. Second operand 3 states. [2019-12-19 02:08:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:56,053 INFO L93 Difference]: Finished difference Result 7032 states and 15538 transitions. [2019-12-19 02:08:56,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:08:56,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-19 02:08:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:56,063 INFO L225 Difference]: With dead ends: 7032 [2019-12-19 02:08:56,063 INFO L226 Difference]: Without dead ends: 7032 [2019-12-19 02:08:56,063 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:08:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7032 states. [2019-12-19 02:08:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7032 to 6535. [2019-12-19 02:08:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6535 states. [2019-12-19 02:08:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6535 states to 6535 states and 14485 transitions. [2019-12-19 02:08:56,130 INFO L78 Accepts]: Start accepts. Automaton has 6535 states and 14485 transitions. Word has length 94 [2019-12-19 02:08:56,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:56,131 INFO L462 AbstractCegarLoop]: Abstraction has 6535 states and 14485 transitions. [2019-12-19 02:08:56,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:08:56,131 INFO L276 IsEmpty]: Start isEmpty. Operand 6535 states and 14485 transitions. [2019-12-19 02:08:56,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 02:08:56,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:56,141 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:08:56,141 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:56,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash 967409837, now seen corresponding path program 1 times [2019-12-19 02:08:56,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:56,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400831860] [2019-12-19 02:08:56,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:56,236 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:08:56,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400831860] [2019-12-19 02:08:56,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:56,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:08:56,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94686621] [2019-12-19 02:08:56,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:08:56,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:56,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:08:56,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:08:56,238 INFO L87 Difference]: Start difference. First operand 6535 states and 14485 transitions. Second operand 4 states. [2019-12-19 02:08:56,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:56,340 INFO L93 Difference]: Finished difference Result 6989 states and 15530 transitions. [2019-12-19 02:08:56,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:08:56,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-19 02:08:56,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:56,348 INFO L225 Difference]: With dead ends: 6989 [2019-12-19 02:08:56,348 INFO L226 Difference]: Without dead ends: 6989 [2019-12-19 02:08:56,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 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:08:56,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6989 states. [2019-12-19 02:08:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6989 to 6410. [2019-12-19 02:08:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6410 states. [2019-12-19 02:08:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6410 states to 6410 states and 14304 transitions. [2019-12-19 02:08:56,474 INFO L78 Accepts]: Start accepts. Automaton has 6410 states and 14304 transitions. Word has length 94 [2019-12-19 02:08:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:56,474 INFO L462 AbstractCegarLoop]: Abstraction has 6410 states and 14304 transitions. [2019-12-19 02:08:56,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:08:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 6410 states and 14304 transitions. [2019-12-19 02:08:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 02:08:56,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:56,483 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, 1, 1] [2019-12-19 02:08:56,483 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:56,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:56,483 INFO L82 PathProgramCache]: Analyzing trace with hash 788317478, now seen corresponding path program 1 times [2019-12-19 02:08:56,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:56,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219016427] [2019-12-19 02:08:56,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:56,549 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:08:56,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219016427] [2019-12-19 02:08:56,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:56,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:08:56,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899137904] [2019-12-19 02:08:56,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:08:56,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:56,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:08:56,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:08:56,553 INFO L87 Difference]: Start difference. First operand 6410 states and 14304 transitions. Second operand 5 states. [2019-12-19 02:08:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:56,662 INFO L93 Difference]: Finished difference Result 7215 states and 16054 transitions. [2019-12-19 02:08:56,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:08:56,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-19 02:08:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:56,671 INFO L225 Difference]: With dead ends: 7215 [2019-12-19 02:08:56,672 INFO L226 Difference]: Without dead ends: 7215 [2019-12-19 02:08:56,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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:08:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7215 states. [2019-12-19 02:08:56,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7215 to 5485. [2019-12-19 02:08:56,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5485 states. [2019-12-19 02:08:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5485 states to 5485 states and 12247 transitions. [2019-12-19 02:08:56,745 INFO L78 Accepts]: Start accepts. Automaton has 5485 states and 12247 transitions. Word has length 96 [2019-12-19 02:08:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:56,745 INFO L462 AbstractCegarLoop]: Abstraction has 5485 states and 12247 transitions. [2019-12-19 02:08:56,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:08:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 5485 states and 12247 transitions. [2019-12-19 02:08:56,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 02:08:56,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:56,750 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, 1, 1] [2019-12-19 02:08:56,750 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:56,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:56,751 INFO L82 PathProgramCache]: Analyzing trace with hash 533580933, now seen corresponding path program 1 times [2019-12-19 02:08:56,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:56,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097521505] [2019-12-19 02:08:56,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:56,806 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:08:56,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097521505] [2019-12-19 02:08:56,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:56,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:08:56,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161216548] [2019-12-19 02:08:56,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:08:56,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:56,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:08:56,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:08:56,809 INFO L87 Difference]: Start difference. First operand 5485 states and 12247 transitions. Second operand 5 states. [2019-12-19 02:08:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:57,395 INFO L93 Difference]: Finished difference Result 8793 states and 19711 transitions. [2019-12-19 02:08:57,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:08:57,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-19 02:08:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:57,407 INFO L225 Difference]: With dead ends: 8793 [2019-12-19 02:08:57,408 INFO L226 Difference]: Without dead ends: 8779 [2019-12-19 02:08:57,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:08:57,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8779 states. [2019-12-19 02:08:57,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8779 to 6401. [2019-12-19 02:08:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6401 states. [2019-12-19 02:08:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6401 states to 6401 states and 14375 transitions. [2019-12-19 02:08:57,506 INFO L78 Accepts]: Start accepts. Automaton has 6401 states and 14375 transitions. Word has length 96 [2019-12-19 02:08:57,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:57,506 INFO L462 AbstractCegarLoop]: Abstraction has 6401 states and 14375 transitions. [2019-12-19 02:08:57,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:08:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 6401 states and 14375 transitions. [2019-12-19 02:08:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 02:08:57,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:57,512 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, 1, 1] [2019-12-19 02:08:57,513 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:57,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:57,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1778345414, now seen corresponding path program 1 times [2019-12-19 02:08:57,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:57,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213688741] [2019-12-19 02:08:57,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:57,582 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:08:57,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213688741] [2019-12-19 02:08:57,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:57,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:08:57,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053772918] [2019-12-19 02:08:57,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:08:57,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:57,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:08:57,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:08:57,584 INFO L87 Difference]: Start difference. First operand 6401 states and 14375 transitions. Second operand 6 states. [2019-12-19 02:08:58,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:58,075 INFO L93 Difference]: Finished difference Result 8059 states and 17963 transitions. [2019-12-19 02:08:58,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 02:08:58,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-19 02:08:58,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:58,090 INFO L225 Difference]: With dead ends: 8059 [2019-12-19 02:08:58,090 INFO L226 Difference]: Without dead ends: 8059 [2019-12-19 02:08:58,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:08:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8059 states. [2019-12-19 02:08:58,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8059 to 6089. [2019-12-19 02:08:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6089 states. [2019-12-19 02:08:58,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6089 states to 6089 states and 13680 transitions. [2019-12-19 02:08:58,222 INFO L78 Accepts]: Start accepts. Automaton has 6089 states and 13680 transitions. Word has length 96 [2019-12-19 02:08:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:58,222 INFO L462 AbstractCegarLoop]: Abstraction has 6089 states and 13680 transitions. [2019-12-19 02:08:58,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:08:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6089 states and 13680 transitions. [2019-12-19 02:08:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 02:08:58,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:58,233 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, 1, 1] [2019-12-19 02:08:58,233 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:58,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:58,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2065003707, now seen corresponding path program 1 times [2019-12-19 02:08:58,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:58,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285825394] [2019-12-19 02:08:58,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:58,378 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:08:58,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285825394] [2019-12-19 02:08:58,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:58,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 02:08:58,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702656002] [2019-12-19 02:08:58,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 02:08:58,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:58,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 02:08:58,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:08:58,381 INFO L87 Difference]: Start difference. First operand 6089 states and 13680 transitions. Second operand 9 states. [2019-12-19 02:08:59,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:59,078 INFO L93 Difference]: Finished difference Result 8643 states and 19355 transitions. [2019-12-19 02:08:59,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 02:08:59,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-19 02:08:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:59,089 INFO L225 Difference]: With dead ends: 8643 [2019-12-19 02:08:59,089 INFO L226 Difference]: Without dead ends: 8625 [2019-12-19 02:08:59,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-12-19 02:08:59,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8625 states. [2019-12-19 02:08:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8625 to 7491. [2019-12-19 02:08:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7491 states. [2019-12-19 02:08:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7491 states to 7491 states and 16803 transitions. [2019-12-19 02:08:59,170 INFO L78 Accepts]: Start accepts. Automaton has 7491 states and 16803 transitions. Word has length 96 [2019-12-19 02:08:59,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:59,170 INFO L462 AbstractCegarLoop]: Abstraction has 7491 states and 16803 transitions. [2019-12-19 02:08:59,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 02:08:59,170 INFO L276 IsEmpty]: Start isEmpty. Operand 7491 states and 16803 transitions. [2019-12-19 02:08:59,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 02:08:59,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:59,177 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, 1, 1] [2019-12-19 02:08:59,177 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:59,177 INFO L82 PathProgramCache]: Analyzing trace with hash 268052348, now seen corresponding path program 1 times [2019-12-19 02:08:59,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:59,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697997559] [2019-12-19 02:08:59,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:59,284 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:08:59,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697997559] [2019-12-19 02:08:59,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:59,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:08:59,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657318702] [2019-12-19 02:08:59,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:08:59,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:59,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:08:59,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:08:59,286 INFO L87 Difference]: Start difference. First operand 7491 states and 16803 transitions. Second operand 8 states. [2019-12-19 02:08:59,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:59,830 INFO L93 Difference]: Finished difference Result 10975 states and 24692 transitions. [2019-12-19 02:08:59,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:08:59,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-12-19 02:08:59,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:59,850 INFO L225 Difference]: With dead ends: 10975 [2019-12-19 02:08:59,851 INFO L226 Difference]: Without dead ends: 10975 [2019-12-19 02:08:59,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-19 02:08:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10975 states. [2019-12-19 02:09:00,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10975 to 7874. [2019-12-19 02:09:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7874 states. [2019-12-19 02:09:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7874 states to 7874 states and 17756 transitions. [2019-12-19 02:09:00,051 INFO L78 Accepts]: Start accepts. Automaton has 7874 states and 17756 transitions. Word has length 96 [2019-12-19 02:09:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:00,052 INFO L462 AbstractCegarLoop]: Abstraction has 7874 states and 17756 transitions. [2019-12-19 02:09:00,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:09:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 7874 states and 17756 transitions. [2019-12-19 02:09:00,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 02:09:00,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:00,066 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, 1, 1] [2019-12-19 02:09:00,066 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:00,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1155556029, now seen corresponding path program 1 times [2019-12-19 02:09:00,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:00,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000763457] [2019-12-19 02:09:00,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:00,211 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:09:00,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000763457] [2019-12-19 02:09:00,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:00,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:09:00,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510176401] [2019-12-19 02:09:00,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:09:00,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:00,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:09:00,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:00,213 INFO L87 Difference]: Start difference. First operand 7874 states and 17756 transitions. Second operand 7 states. [2019-12-19 02:09:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:00,393 INFO L93 Difference]: Finished difference Result 10343 states and 23153 transitions. [2019-12-19 02:09:00,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:09:00,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-19 02:09:00,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:00,407 INFO L225 Difference]: With dead ends: 10343 [2019-12-19 02:09:00,408 INFO L226 Difference]: Without dead ends: 10343 [2019-12-19 02:09:00,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:09:00,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10343 states. [2019-12-19 02:09:00,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10343 to 7981. [2019-12-19 02:09:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7981 states. [2019-12-19 02:09:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7981 states to 7981 states and 17779 transitions. [2019-12-19 02:09:00,593 INFO L78 Accepts]: Start accepts. Automaton has 7981 states and 17779 transitions. Word has length 96 [2019-12-19 02:09:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:00,593 INFO L462 AbstractCegarLoop]: Abstraction has 7981 states and 17779 transitions. [2019-12-19 02:09:00,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:09:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 7981 states and 17779 transitions. [2019-12-19 02:09:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 02:09:00,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:00,600 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, 1, 1] [2019-12-19 02:09:00,600 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:00,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:00,601 INFO L82 PathProgramCache]: Analyzing trace with hash -576419523, now seen corresponding path program 1 times [2019-12-19 02:09:00,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:00,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635070378] [2019-12-19 02:09:00,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:00,688 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:09:00,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635070378] [2019-12-19 02:09:00,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:00,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:00,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712429342] [2019-12-19 02:09:00,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:00,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:00,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:00,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:00,690 INFO L87 Difference]: Start difference. First operand 7981 states and 17779 transitions. Second operand 6 states. [2019-12-19 02:09:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:00,829 INFO L93 Difference]: Finished difference Result 7711 states and 17005 transitions. [2019-12-19 02:09:00,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:09:00,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-19 02:09:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:00,840 INFO L225 Difference]: With dead ends: 7711 [2019-12-19 02:09:00,840 INFO L226 Difference]: Without dead ends: 7711 [2019-12-19 02:09:00,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:09:00,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7711 states. [2019-12-19 02:09:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7711 to 4813. [2019-12-19 02:09:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4813 states. [2019-12-19 02:09:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 10650 transitions. [2019-12-19 02:09:00,904 INFO L78 Accepts]: Start accepts. Automaton has 4813 states and 10650 transitions. Word has length 96 [2019-12-19 02:09:00,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:00,904 INFO L462 AbstractCegarLoop]: Abstraction has 4813 states and 10650 transitions. [2019-12-19 02:09:00,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 4813 states and 10650 transitions. [2019-12-19 02:09:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:00,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:00,909 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, 1, 1, 1, 1] [2019-12-19 02:09:00,909 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:00,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash -712112196, now seen corresponding path program 1 times [2019-12-19 02:09:00,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:00,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46458385] [2019-12-19 02:09:00,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:01,009 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:09:01,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46458385] [2019-12-19 02:09:01,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:01,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:01,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428090064] [2019-12-19 02:09:01,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:01,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:01,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:01,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:01,011 INFO L87 Difference]: Start difference. First operand 4813 states and 10650 transitions. Second operand 5 states. [2019-12-19 02:09:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:01,054 INFO L93 Difference]: Finished difference Result 4813 states and 10641 transitions. [2019-12-19 02:09:01,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:09:01,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-19 02:09:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:01,059 INFO L225 Difference]: With dead ends: 4813 [2019-12-19 02:09:01,060 INFO L226 Difference]: Without dead ends: 4813 [2019-12-19 02:09:01,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2019-12-19 02:09:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 4813. [2019-12-19 02:09:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4813 states. [2019-12-19 02:09:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 10641 transitions. [2019-12-19 02:09:01,104 INFO L78 Accepts]: Start accepts. Automaton has 4813 states and 10641 transitions. Word has length 98 [2019-12-19 02:09:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:01,104 INFO L462 AbstractCegarLoop]: Abstraction has 4813 states and 10641 transitions. [2019-12-19 02:09:01,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 4813 states and 10641 transitions. [2019-12-19 02:09:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:01,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:01,109 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, 1, 1, 1, 1] [2019-12-19 02:09:01,109 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:01,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:01,109 INFO L82 PathProgramCache]: Analyzing trace with hash 175391485, now seen corresponding path program 1 times [2019-12-19 02:09:01,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:01,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218490798] [2019-12-19 02:09:01,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:01,235 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:09:01,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218490798] [2019-12-19 02:09:01,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:01,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 02:09:01,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47383311] [2019-12-19 02:09:01,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 02:09:01,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:01,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 02:09:01,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:09:01,237 INFO L87 Difference]: Start difference. First operand 4813 states and 10641 transitions. Second operand 10 states. [2019-12-19 02:09:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:01,703 INFO L93 Difference]: Finished difference Result 15273 states and 34417 transitions. [2019-12-19 02:09:01,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 02:09:01,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-12-19 02:09:01,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:01,715 INFO L225 Difference]: With dead ends: 15273 [2019-12-19 02:09:01,715 INFO L226 Difference]: Without dead ends: 10222 [2019-12-19 02:09:01,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-19 02:09:01,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10222 states. [2019-12-19 02:09:01,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10222 to 4827. [2019-12-19 02:09:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4827 states. [2019-12-19 02:09:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4827 states to 4827 states and 10587 transitions. [2019-12-19 02:09:01,785 INFO L78 Accepts]: Start accepts. Automaton has 4827 states and 10587 transitions. Word has length 98 [2019-12-19 02:09:01,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:01,785 INFO L462 AbstractCegarLoop]: Abstraction has 4827 states and 10587 transitions. [2019-12-19 02:09:01,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 02:09:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 4827 states and 10587 transitions. [2019-12-19 02:09:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:01,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:01,789 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, 1, 1, 1, 1] [2019-12-19 02:09:01,789 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:01,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:01,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1383760123, now seen corresponding path program 1 times [2019-12-19 02:09:01,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:01,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176677420] [2019-12-19 02:09:01,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:01,861 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:09:01,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176677420] [2019-12-19 02:09:01,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:01,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:01,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204084370] [2019-12-19 02:09:01,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:01,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:01,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:01,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:01,863 INFO L87 Difference]: Start difference. First operand 4827 states and 10587 transitions. Second operand 5 states. [2019-12-19 02:09:02,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:02,173 INFO L93 Difference]: Finished difference Result 4564 states and 9898 transitions. [2019-12-19 02:09:02,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:09:02,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-19 02:09:02,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:02,181 INFO L225 Difference]: With dead ends: 4564 [2019-12-19 02:09:02,182 INFO L226 Difference]: Without dead ends: 4546 [2019-12-19 02:09:02,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2019-12-19 02:09:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 4203. [2019-12-19 02:09:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4203 states. [2019-12-19 02:09:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4203 states to 4203 states and 9167 transitions. [2019-12-19 02:09:02,249 INFO L78 Accepts]: Start accepts. Automaton has 4203 states and 9167 transitions. Word has length 98 [2019-12-19 02:09:02,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:02,250 INFO L462 AbstractCegarLoop]: Abstraction has 4203 states and 9167 transitions. [2019-12-19 02:09:02,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 4203 states and 9167 transitions. [2019-12-19 02:09:02,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:02,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:02,256 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, 1, 1, 1, 1] [2019-12-19 02:09:02,257 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:02,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:02,257 INFO L82 PathProgramCache]: Analyzing trace with hash -919272570, now seen corresponding path program 1 times [2019-12-19 02:09:02,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:02,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200290423] [2019-12-19 02:09:02,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:02,370 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:09:02,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200290423] [2019-12-19 02:09:02,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:02,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:02,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718491259] [2019-12-19 02:09:02,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:02,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:02,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:02,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:02,372 INFO L87 Difference]: Start difference. First operand 4203 states and 9167 transitions. Second operand 6 states. [2019-12-19 02:09:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:02,580 INFO L93 Difference]: Finished difference Result 4767 states and 10312 transitions. [2019-12-19 02:09:02,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:09:02,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-19 02:09:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:02,587 INFO L225 Difference]: With dead ends: 4767 [2019-12-19 02:09:02,587 INFO L226 Difference]: Without dead ends: 4739 [2019-12-19 02:09:02,588 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:09:02,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4739 states. [2019-12-19 02:09:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4739 to 4196. [2019-12-19 02:09:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4196 states. [2019-12-19 02:09:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 9088 transitions. [2019-12-19 02:09:02,642 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 9088 transitions. Word has length 98 [2019-12-19 02:09:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:02,642 INFO L462 AbstractCegarLoop]: Abstraction has 4196 states and 9088 transitions. [2019-12-19 02:09:02,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 9088 transitions. [2019-12-19 02:09:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:02,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:02,647 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, 1, 1, 1, 1] [2019-12-19 02:09:02,647 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:02,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:02,647 INFO L82 PathProgramCache]: Analyzing trace with hash -750459706, now seen corresponding path program 2 times [2019-12-19 02:09:02,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:02,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172966207] [2019-12-19 02:09:02,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:02,723 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:09:02,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172966207] [2019-12-19 02:09:02,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:02,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:02,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160232445] [2019-12-19 02:09:02,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:02,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:02,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:02,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:02,725 INFO L87 Difference]: Start difference. First operand 4196 states and 9088 transitions. Second operand 6 states. [2019-12-19 02:09:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:02,927 INFO L93 Difference]: Finished difference Result 4345 states and 9390 transitions. [2019-12-19 02:09:02,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:02,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-19 02:09:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:02,932 INFO L225 Difference]: With dead ends: 4345 [2019-12-19 02:09:02,932 INFO L226 Difference]: Without dead ends: 4345 [2019-12-19 02:09:02,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:09:02,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4345 states. [2019-12-19 02:09:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4345 to 4164. [2019-12-19 02:09:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4164 states. [2019-12-19 02:09:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 9016 transitions. [2019-12-19 02:09:02,974 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 9016 transitions. Word has length 98 [2019-12-19 02:09:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:02,974 INFO L462 AbstractCegarLoop]: Abstraction has 4164 states and 9016 transitions. [2019-12-19 02:09:02,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 9016 transitions. [2019-12-19 02:09:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:02,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:02,979 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, 1, 1, 1, 1] [2019-12-19 02:09:02,979 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:02,980 INFO L82 PathProgramCache]: Analyzing trace with hash -589506809, now seen corresponding path program 2 times [2019-12-19 02:09:02,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:02,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743681533] [2019-12-19 02:09:02,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:09:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:09:03,064 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 02:09:03,064 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 02:09:03,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:09:03 BasicIcfg [2019-12-19 02:09:03,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 02:09:03,302 INFO L168 Benchmark]: Toolchain (without parser) took 52146.90 ms. Allocated memory was 145.2 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 101.6 MB in the beginning and 887.2 MB in the end (delta: -785.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-19 02:09:03,302 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 02:09:03,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.36 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 156.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:03,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.63 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 154.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:03,303 INFO L168 Benchmark]: Boogie Preprocessor took 41.41 ms. Allocated memory is still 202.4 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:03,303 INFO L168 Benchmark]: RCFGBuilder took 840.98 ms. Allocated memory is still 202.4 MB. Free memory was 151.6 MB in the beginning and 106.6 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:03,304 INFO L168 Benchmark]: TraceAbstraction took 50443.88 ms. Allocated memory was 202.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.6 MB in the beginning and 887.2 MB in the end (delta: -780.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-19 02:09:03,306 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.80 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 752.36 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 156.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.63 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 154.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.41 ms. Allocated memory is still 202.4 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 840.98 ms. Allocated memory is still 202.4 MB. Free memory was 151.6 MB in the beginning and 106.6 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50443.88 ms. Allocated memory was 202.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.6 MB in the beginning and 887.2 MB in the end (delta: -780.5 MB). Peak memory consumption was 1.5 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: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L709] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L710] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L711] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L712] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L713] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L714] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L715] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L716] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L717] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L718] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L719] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L720] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L721] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L722] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L723] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 0 pthread_t t899; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t899, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 0 pthread_t t900; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L728] 1 z$w_buff1 = z$w_buff0 [L729] 1 z$w_buff0 = 1 [L730] 1 z$w_buff1_used = z$w_buff0_used [L731] 1 z$w_buff0_used = (_Bool)1 [L806] FCALL, FORK 0 pthread_create(&t900, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L775] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z = z$flush_delayed ? z$mem_tmp : z [L778] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L816] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L819] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 50.0s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9776 SDtfs, 10221 SDslu, 22606 SDs, 0 SdLazy, 8854 SolverSat, 533 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 105 SyntacticMatches, 21 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71014occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.8s AutomataMinimizationTime, 36 MinimizatonAttempts, 85773 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2814 NumberOfCodeBlocks, 2814 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2680 ConstructedInterpolants, 0 QuantifiedInterpolants, 557856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...